• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권2호
• /
• pp.113-119
• /
• 2000

본 논문에서는 주기억장치 데이타베이스의 특성을 반영하여 시간제약조건을 처리할 수 있는 실시간 주기억장치 데이타베이스시스템을 위한 질의 처리기를 설계하고 구현한다. 제안된 질의 처리기는 메타 데이타베이스를 이용하여 시간제약을 갖는 실시간 데이타를 유지 관리한다. 응용 프로그램의 작성을 위해서 CLI를 지원하고 있으며, 이를 확장한 확장 CLI와 저장 CLI를 지원하여 확장 CLI를 이용하여 실시간 트랜잭션의 정보를 CLI를 사용으로 표현할 수 있도록 하였고, 빈번하게 수행되는 트랜잭션을 지원하기 위해 저장 CLI를 지원한다. 제안된 질의 처리기는 주기억장치 실시간 데이타베이스 관리시스템의 질의처리기로 구현하였으며, 성능평가를 통해서 시스템의 질의처리 능력과 실시간 데이타의 효율적인 관리를 통해서 종료시한을 만족하는 실시간 트랜잭션의 비율이 증가됨을 보였다.

• 한국정보통신학회논문지
• /
• 제9권1호
• /
• pp.210-216
• /
• 2005

대부분의 실시간 응용에서 보안은 또 하나의 중요한 요구 사항이 되고 있다. 따라서 보안 실시간 데이터베이스 시스템은 다양한 보안 등급을 갖는 여러 사용자가 공유하거나 악의를 갖은 해커에 의해 공격될 수 있는 민감한 정보를 관리해야 한다. 보안 실시간 데이터베이스 시스템이 보안을 위해서는 기존의 보안 방법뿐만 아니라 암호화 정책을 적용하는 것이 필요하다. 그렇지만 민감한 정보가 실시간 시스템에서도 보호되어야만 함에도 불구하고 보안 실시간 데이터베이스 시스템에서 암호화정책을 지원하기 위한 연구가 많지 않았다. 본 논문에서는 보안 실시간 데이터베이스 시스템의 이러한 암호화 정책 문제를 해결하기 위한 암호화 관리자를 제안한다. 보안 실시간 데이터베이스 시스템의 암호화 정책에서 중요한 것은 보안성과 시간성이다. 제안된 암호화 관리자의 중요한 특징은 트랜잭션 데드라인과 보안 수준을 고려하여 데이터를 동적으로 암호화하는 것이다.

• 한국정보처리학회논문지
• /
• 제7권6호
• /
• pp.1753-1765
• /
• 2000

As the areas of computer application are expanded, real-time application environments that must process as many transactions as possible within their deadlines, such as a stock transaction systems, ATM switching systems etc, have been increased recently. The reason why the conventional database systems can't process soft real-time applications is the lack of prediction and poor performance on processing transaction's deadline. If transactions want to access data stored at the secondary storage, they can not satisfy requirements of real-time applications because of the disk delay time. This paper designs a main-memory database prototype systems to be suitable to real-time applications and then this system can produce rapid results without disk i/o as all of the information are loaded in main memory database. In thesis proposed the improved techniques with respect to logging, checkpointing, and recovering in our environment. In order to improve the performance of the system, a) the frequency of log analysis and redo processing is reduced by the proposed redo technique at system failure, b) database consistency is maintained by improved fuzzy checkpointing. The performance model is proposed which consists of two parts. The first part evaluates log processing time for recovery and compares with other research activities. The second part examines checkpointing behavior.

• 한국시뮬레이션학회논문지
• /
• 제3권1호
• /
• pp.125-134
• /
• 1994

In real-time database systems, transactions's commitment done before the given deadlines is more important than just getting the maximum throughput. Transactions missing the given deadlines are no longer meaningful in real-time applications. Therefore, there is a need for new transaction processing models to meet the given deadlines in real-time database applications, because moat conventional transaction models are not designed to meet deadlines. In this paper we propose a new transaction models which uses multiple versions of a data item. The model uses read-from graphs and dynamic reorder of transactions to meet deadlines. A read-from graph contains the past read semantics of read operations and support the model to decide which database operation to be taken. Then, we show simulation results comparing the proposed model with other transaction models such as two phase locking model and the optimistic concurrency control model.

• Journal of Electrical Engineering and information Science
• /
• 제2권5호
• /
• pp.89-99
• /
• 1997

The application for real-time database systems must satisfy timing constraints. Typically the timing constraints are expressed in the form of deadlines which are represented by priorities to e used by schedulers. In any real-time applications, since the system maintains sensitive information to be shared by multiple users with different levels of security clearance, security is another important requirement. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, protocols that satisfy both requirements need to be developed. In this appear, we proposed a new priority-driven secure multiversion locking (PSMVL) protocol for real-time secure database systems. The schedules produced by PSMVL are proven to e one-copy serializable. We have also shown tat the protocol eliminates covert channels and priority inversions. The details of the protocol, including the compatibility matrix and the version selection algorithms are presented. the results of the performance comparisons of our protocol with other protocols are described.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2001년도 춘계학술대회
• /
• pp.293-299
• /
• 2001

• 연구논문집
• /
• 통권27호
• /
• pp.167-174
• /
• 1997

Point of Production/Manufacturing Execution Systems are an essential component of operations in today's competitive business environments, which require greater production efficiency and effectiveness. POP/MES focuses on the valuing-adding processes, helping to reduce manufacturing cycle time, improve product quality, reduce WIP, reduce or eliminate paperwork between shifts, reduce lead time and empowering plant operations staff. In this paper, we implement POP/MES to manage real-time plant floor data which is gathered by I/O server into database management system. I/O server is a software allows data exchange between factory real-time database and several hardware devices such as PLC, DCS, robot and sensor through ethernet TCP/IP protocol.

• 한국철도학회논문집
• /
• 제19권4호
• /
• pp.445-455
• /
• 2016

실시간 철도안전 관제시스템은 철도시스템을 구성하는 열차, 신호, 전력 및 설비 등으로 분산되어 감시되던 시스템의 안전관련 데이터를 통합하여 안전감시 효율을 향상시키고 사고를 예방하는 것이 목적으로, 기존 개별 감시 시스템과 달리 데이터의 대용량 처리와 실시간 처리 성능을 동시에 요구하고 있다. 기존 관제시스템에서 주로 활용되는 디스크 기반 데이터베이스는 실시간 및 빅 데이터 처리기능이 없고, 최근 도입되는 메모리 기반 데이터베이스는 빅데이터 처리기능이 없으며, 시계열 데이터베이스는 실시간 처리 기능이 없다. 이에 따라, 실시간 안전관제에서 요구되는 빅 데이터 처리와 실시간 처리를 동시에 제공하는 새로운 솔루션이 필요하다. 본 연구에서는 기존 관제의 데이터 처리 사례를 분석하고, 빅 데이터 처리와 실시간 처리를 동시에 제공하는 새로운 데이터 처리 방안을 제안하였으며, 이를 검증하였다.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 2010년도 추계 학술발표회
• /
• pp.1282-1288
• /
• 2010

In this study, Site Investigation Program of cut slope is developed using related techniques and experience got from practical application of Inventory Survey Program of cut slope in work for last 4 years. The Site Investigation Program is designed to can be loaded to the Mobile PC for convenience of carrying in filed, convenience of data input and revision, application of diverse programs, convenience of confirming data and facility of establishment of real-time database system using wireless communication like Inventory Survey Program. Also, for connection with Inventory Survey Program, it has a same work process and can establish real-time database system of almost data obtained in filed using stability analysis tool loaded in this program. Application of this developed program is expected to be an opportunity that can contribute to development of slope investigation and database system area using IT techniques.

• 정보기술과데이타베이스저널
• /
• 제8권2호
• /
• pp.103-114
• /
• 2001

In this paper, we propose an efficient index mechanism for real-time main memory database systems. Existing main memory index structures based on the tree can effectively support range searches. However, it doesn't guarantee the real-time characteristic because difference between the access time of a node and an average access time can be high. The index structures based on the hash have always a regular random access time on the simple searches and that speed is very fast. However they do not support range searches. To solve such problems, we propose a new index mechanism called Hyper Tree-Hash (Hyper-TH) that combines ECBH (Extendible Chained Bucket Hashing) and T＊-tree. ECBH can be dynamically extended and has a very fast access time. T＊-tree effectively supports the range searches. We show through our experiments that the proposed mechanism outperforms existing other index structures.