• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.628-640
• /
• 2005

The XML is well accepted in several different Web application areas. As soon as many users and applications work concurrently on the same collection of XML documents, isolating accesses and modifications of different transactions becomes an important issue. When an XML document correctly corresponds to the rules laid out in a DTD or XML schema, it is also said to be valid. The valid XML document's validity should be guaranteed after the document is updated. The validation method mentioned above, however, results in lower degree of concurrency. For getting higher degree of concurrency and minimizing the range of the XML document validity, a new validation method based on a specific locking method is required. In this paper we propose the sequence group validation method for minimizing the range of the XML document validity. We also propose the boundary locking method for isolating accesses and modifications of different transactions while supporting the valid XML document's validity. Finally, the results of some experiments show the validation and locking methods increase the degree of transaction concurrency.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.115-121
• /
• 2010

It always must guarantee preceding process of the transaction with the higher priority in real-time database systems. The pessimistic concurrency control method resolves a conflict through aborting or blocking of a low priority transaction. However, if a high priority transaction is eliminated in a system because of its deadline missing, an unnecessary aborting or blocking of a low priority transaction is occurred. In this paper, the proposed method eliminates a transaction that is about to miss its deadline. And it prevents needless wastes of resources and eliminates unnecessary aborting or blocking of a low priority transaction. It is shown through the performance evaluation that the proposed method outperforms the existing methods in terms of the deadline missing ratio of transactions.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.4
• /
• pp.71-83
• /
• 2008

The recent advances of the information technology have motivated lots of research efforts to develop new computer-aided teaching and learning methodologies on various computer science topics, such as data structures, operating system, computer networks, and computer architecture. However, there have been only few studies to educate the database subject although it is one of the most important topics in the computer science. Specifically, among the various issues in the database subject, a learner often suffers to understand the mechanism of the concurrency control and recovery of database transaction in the database because it highly interacts with other functions in the database. Obviously, an intelligent visualization tool can help a learner to understand the process of the concurrency control and the recovery of database transaction. The purpose of this study is to develop an efficient visualization tool which can help users understand the two phase locking protocol (2PLP)-based concurrency control. Specifically, this visualization tool is designed to encourage a users' participation and raise their interest by visualizing the process of transactions and allowing users to specify and manipulate their own transactions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.569-570
• /
• 2017

Bitcoin-based blockchain technology provides an infrastructure that enables anonymous smart contracts, low-cost remittances, and online payments. However, the block-chain technology that implements the bitcoin has scalability constraints in tradeoffs between throughput and latency. To solve these problems, the Byzantine fault tolerant block-chain technique has been proposed. This technique improves throughput without increasing latency by selecting a leader and constructing many microblocks that do not contain proofs of work within the existing block by the leader. However, this technique may be less secure than existing techniques in selecting the reader. In this paper, we propose a technique for scalability of the blockchain technology by using microblock technology and parallel execution technique. Within one microblock there is information about several transactions. In the proposed scheme, the throughput of the microblocks can be increased by performing concurrently.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.207-216
• /
• 2001

이동 방송 환경은 정보를 가지고 있는 서버가 다수의 이동 클라이언트에게 모든 데이터를 주기적으로 방송하면 클라이언트가 자신이 원하는 데이터가 방송 채널에 나타날 때 이를 검색하는 환경을 말한다. 이때 클라이언트가 수행하는 읽기 전용 트랜잭션은 일관적이면서도 가장 최근에 갱신된 데이터를 필요로한다. 이동 방송환경에 적합하도록 연구된 기존의 병행성 제어 기법들을 클라이언트가 일관적인 데이터를 읽는 것은 보장하지만 가장 최근에 갱신된 데이터를 읽을수 있게 하는 최신 현행성은 보장하지 못한다. 본 논문에서는 기존 기법들과 동일한 수준의 일관성뿐만 아니라 최신 현행성을 보장하는 효율적인 병행성 제어 기법을 제안하고 이를 검증한다. 아울러 제안된 기법의 성능을 평가하기 위하여 최신이 아닌 데이터를 읽은 경우(stale read)의 수와 트랜잭션 중단의 수를 각각 측정하였다. 시뮬레이션을 통한 실험결과 본 논문에서 제안하는 기법은 기존의 방법과 비교할 때 항상 최신의 데이터를 읽으면서 트랜잭션중단의 수를 감소시킨다는 것을 알수 있었다.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.11-20
• /
• 2002

We propose a new concurrency control algorithm for enhancing the degree of parallelism of the transactions in fully replicated databases designed to improve the availability and the reliability. The update transactions can be logically decomposed of a read-only transaction and a write-only transaction. In our algorithm, a set of read operations of an update transaction is treated as a read-only transaction and the read-only transaction reads data items in the site to which it is submitted. And a set of write operations of the update transaction is treated as a write-only transaction and it is submitted to all corresponding sites after the update transaction has been completed. By using the proposed update protocol, all write-only transactions can execute at all sites atomically. The proposed algorithm can have transactions execute concurrently at the site to which they are submitted and, after the completion of each transaction, the update protocol is performed for updating their data items and checking their serializability. Therefore, the degree of parallelism of the transactions can be improved. Especially, if the probability of conflict among transactions is low, we can expect the higher degree of their parallelism.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.5
• /
• pp.1587-1600
• /
• 1991

본 연구에서는 로봇조작기를 강체부와 유연한 외팔보로 이루어진 모델로 설정 한 후 확장된 Hamilton의 원리를 적용하여 제어계의 운동방정식을 유도하였다. 계를 유한개의 제어 모드와 잔류 모드로 구분하고, 제어 모드에 대해 최적제어를 수행하기 위해 관측기를 설계하였으며, 진동에 관련된 측정 불가능한 상태변수를 추정하였다. 분석과 검토는 서보모터가 모든 제어를 담당하는 방식과 서보모터의 제어 방식에 작동 기를 추가시켜 병행 제어하는 다입출력 방식으로 구별하여 수행하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.484-493
• /
• 2001

As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1998.05a
• /
• pp.258-263
• /
• 1998

원자력 발전소의 제어봉 낙하 시간 측정 시험은 원자로 비상 정지 명령에 따른 제어봉의 낙하 속응성이 지침서의 제한치 이내에 있는지를 주기적으로 확인함으로써 제어봉의 원자로 안전 운전 및 정지 기능을 확인하는 중요한 시험이다. 현재 고리2호기를 비롯한 WH형 발전소들은 제어봉이 디지틀 제어봉 위치 지시(DRPI) 코일속을 낙하할 때 유기되는 전압을 검출하여 제어봉 낙하 시간을 측정하는 방법을 사용하고 있다. 이 방법은 제어봉을 뱅크별로 인출한 후 하나씩 개별 낙하시키기 때문에, 제어봉 낙하 시간 측정 시험에 많은 시간과 다수의 인력이 소요되며, 측정시 격납용기내에 작업자가 장시간 체류해야 하는 단점이 있다. 이러한 DRPI 신호 이용 제어봉 낙하 시간 측정 방법의 단점을 보완하여 제어봉 구동 장치(CRDM)내 이동권선 신호를 이용하는 다중 낙하 방식의 새로운 측정 방법을 제안하고, 측정 장치를 개발하였다. 개발된 제어봉 낙하 시간 측정 장치를 이용하여, 고리2호기 제어봉 낙하 시간 측정 시험시 기존의 방법과 병행 측정 시험을 수행하고 그 결과를 비교 검토하여 충분히 정확하게 제어봉 낙하 시간을 측정할 수 있음을 보였다.