• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.85-87
• /
• 2005

메인 메모리 데이터베이스 시스템은 디스크 기반 데이터베이스 시스템에 비해 디스크 접근을 줄임으로써, 좀 더 빠른 트랜잭션 처리를 보여주고 있다. 그러나 전원 차단과 같은 장애 발생 시, 메모리의 휘발성으로 인한 데이터 손실에 항상 대비를 해야 한다. 증권, 통신사와 같이 실시간 서비스가 이루어지고, 시스템 장애가 큰 손실로 이어지는 곳에서는 장애 발생 시 데이터의 빠른 복구를 필요로 하게 된다. 본 논문은 메인 메모리 데이터베이스 시스템에서 백업 시에 인덱스의 최대키 값을 따로 저장하는 추가 작업을 통하여, 병렬처리가 가능한 CST-트리(Cache Sensitive T-tree)의 인덱스 복구 알고리즘을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1508-1511
• /
• 2007

부동산문제등과 관련하여 지적(地籍) 및 용도지역지구 자료의 중요성이 부각되면서, 복잡한 법적 절차를 갖춘 시스템이 구축되고 있다. 그 중 한국토지정보시스템(KLIS)은 각 지자체별 지적 및 도시계획 관련 데이터 구축, 업무시스템 및 건축 인허가등의 민원발급, 부동산 관련 다양한 통계 등을 제공하고 있다. 그러나, 이 시스템이 설치되어 있는 시군구 중 일반구(區)를 포함한 시(市)의 경우는 법적인 편집 권한이 다른 기관에서 공통 데이터베이스의 편집에 따른 데이터 무결성 문제와 네트워크 장애에 따른 업무 지연 등의 업무 연속성 문제를 야기할 수 있다. 본 논문에서는 일반구가 포함된 시(市)에서의 지적도편집, 용도지역지구도 편집 등 이종의 기관에서 이루어지는 분산 환경 데이터베이스편집에 따른 동기화의 문제점을 제기하고, 이러한 문제점을 보완할 수 있도록 트랜잭션 단위로 공간 및 속성 데이터의 복제를 담당하는 Replicator를 이용한 분산 데이터베이스 동기화 아키텍처를 제안하고, 동기화부분과 표준화부분, 트랜잭션관리부분으로 구성되어 있는 Replicator의 구성요소를 설계 및 구현하고 Replicator를 이용한 분산 데이터베이스의 변경부분을 미반영 데이터베이스에 반영하는 처리절차와 처리 후 결과를 제시하여, 지적 및 용도지역관련 데이터를 두 개 이상의 기관에서 동시에 편집한 내용이 실시간으로 두 기관의 분산 데이터베이스에 변경 분이 반영되어 모두 동기화 되어 있는 것을 공간데이터 편집기로 확인해 볼 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.372-385
• /
• 2002

In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.433-440
• /
• 2003

According as the real economic activities are carried out in the cyber world and the identity problem of a trade counterpart emerges, digital signature has been diffused. Due to the weakness for real-time validation using the validation method of digital signature, Certificate Revocation List, On-line Certificate Status Protocol was introduced. In this case, every transaction workload requested to verify digital signature is concentrated of a validation server node. Currently this method has been utilized on domestic financial transactions, but sooner or later the limitation will be revealed. In this paper, the validation method will be introduced which not only it can guarantee real-time validation but also the requesting node of certificate validation can maintain real-time certificate status information. This method makes the revocation management node update the certificate status information in real-time to the validation node while revoking certificate. The characteristic of this method is that the revocation management node should memorize the validation nodes which a certificate holder uses. If a certificate holder connects a validation node for the first time, the validation node should request its certificate status information to the above revocation management node and the revocation management node memorizes the validation node at the time. After that, the revocation management node inform the revocation information in real-time to all the validation node registered when a request of revocation happens. The benefits of this method are the fact that we can reduce the validation time because the certificate validation can be completed at the validation node and that we can avoid the concentration of requesting certificate status information to a revocation node.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.31-32
• /
• 2008

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.25-33
• /
• 2004

Mobile IP Low Latency Handoffs(l) allow greater support for real-time services on a Mobile IP network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authentication the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring further involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that performs a trusted thirty party. The proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.1
• /
• pp.79-89
• /
• 2004

Mobile IP Low Latency Handoffs allow greater support for real-time services on a Mobile W network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authenticate the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring funker involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that Performs a ousted thirty party. The Proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.125-133
• /
• 2016

Data processing capacity and speed are rapidly increasing due to the development of hardware and software in recent time. As a result, data usage is geometrically increasing and the amount of data which computers have to process has already exceeded five-thousand transaction per second. That is, the importance of Big Data is due to its 'real-time' and this makes it possible to analyze all the data in order to obtain accurate data at right time under any circumstances. Moreover, there are many researches about this as construction of smart factory with the application of Big Data is expected to have reduction in development, production, and quality management cost. In this paper, system using In-Memory Data Grid for high speed processing is implemented in semiconductor process which numerous data occur and improved performance is proven with experiments. Implemented system is expected to be possible to apply on not only the semiconductor but also any fields using Big Data and further researches will be made for possible application on other fields.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.85-91
• /
• 2019

In this paper, we propose a new logging and recovery scheme that is suited for the high-performance transaction processing system base on flash memory storage. The proposed scheme is designed by considering flash's I/O characteristic of asymmetric costs between page update/read operations. That is, we substitute the costly update operation with writing and real-time usage of snapshot log, which is for the page-level physical redo. From this, we can avoid costly rewriting of a dirty page when it is evicted form a buffering pool. while supporting efficient revery procedure. The proposed scheme would be not lucrative in the case of HDD-based system. However, the proposed scheme offers the performance advance sush as a reduced number of updates and the fast system recovery time, in the case of flash storage such as SSD (solid state drive). Because the proposed scheme can easily be applied to existing systems by saving our snapshot records and ordinary log records together, our scheme can be used for improving the performance of upcoming SSD-based database systems through a tiny modification to existing REDO algorithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.29-37
• /
• 2009

Recently, message based data transmission plays an important role in modem computing systems. Especially JMS(Java Message Service) is one of the most popular messaging platform. However, because of its characteristics for maintaining reliability, if we want to use it for transmission of large scale messages in a distributed Internet environment by using a WAN connection which may not be robust enough, we need to employ a different method to minimize total transmission time of messages. We found the fact that the total time of message transmission heavily depends on size of a message. In order to achieve the ideal size of a message, we develope a novel mechanism and a system which finds the ideal size of a message and automatical1y control JMS applications for minimizing transmission time. Finally, we test the proposed mechanism and system using real-data in order to prove advantages and compared with the naive mechanism. As a conclusion, we showed that our proposed mechanism and system provide an effective way to reduce transmission time of large scale messages in distributed environment.