• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.41-48
• /
• 2005

In this thesis, we propose a concurrency control scheme which schedules global transactions in multidatabase systems Unlike other scheme which commit global transactions as soon as they have finished their execution, this scheme has attempted to delay them if their exist another global transactions that should be proceeded. Owing to the deferred commitment, the number of global restarts could be greatly reduced. This scheme's performance gain increased through simulations in case more than one LDBS employ timestamp ordering(TO) as a local concurrency control scheme.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.327-338
• /
• 1996

In this paper, we present a new checkpointing algorithm to preserve the consistency of resources in distributed transaction processing systems, and the error recovery algorithms to recover form the failure. In comparison with the existed algorithms, the checkpointing algorithm proposed in this paper can minimize the interference of the distributed transaction and the stroage cost during checkpointing, and does not need the extra message to make th checkpoint. Also we show that the error recovery algorithms prevent the distributed transaction with a partial fault from spreading the fault, which calls domnio-effect and prevent them from restarting cyclically. And we describe the correctness and the performane of the proposed algorithms.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.297-306
• /
• 2004

Push-based broadcasting in wireless information services is a very effective technique to disseminate information to a massive number of clients when the number of data items is small. When the database is large, however, it nay be beneficial to integrate a pull-based (client-to-server) backchannel with the push-based broadcast approach, resulting in a hybrid data delivery. In this paper, we analyze the performance behavior of a predeclaration-based transaction processing, which was originally devised for a push-based data broadcast, in the hybrid data delivery through an extensive simulation. Our results show that the use of predeclaration-based transaction processing can provide significant performance improvement not only in a pure push data delivery, but also in a hybrid data delivery.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.356-363
• /
• 2002

Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we improve the real -time active concurrency control algorithm by applying Thomas' write rule and considering relationship between transactions fired by active rules. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms. The experimental results show that our algorithm has superior performance with respect to the raio of transactions satisfying deadline.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.637-639
• /
• 2007

HVEM DataGrid[1]는 연구자들이 초고압 전자현미경(HVEM-High Voltage Electron Microscope)을 이용한 실험 결과를 효율적으로 관리하고 공유하기 위한 공간이다. 여러 사람들이 동시에 이용하는 시스템으로 이종 저장소(heterogeneous storage)들을 포함할 수 있는 HVEM DataGrid 는 HVEM 실험결과를 이들의 메타정보와 같이 동기적으로 저장해야 한다. 이런 HVEM DataGrid 의 특성을 고려한 트랜잭션 관리는 트랜잭션의 ACID 성질을 만족하는 동시에 용량이 큰 e-Science 결과물을 효율적으로 다룰 수 있는 방안이 또한 필요하다. 따라서, 본 논문은 HVEM DataGrid 의 이종 저장소에 걸친 트랜잭션에 대한 효율적인 관리 방안을 제안한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.106-111
• /
• 1998

본 연구의 목적은 트랜잭션 순서화 기법중 데이터 우선순위 알고리즘(DPLP: Data-Priority Based Locking Potocol)의 높은 재시작 비율을 낮추고, 시스템의 처리 효율을 향상 시키는 것이다. 이를 위해서 트랜잭션을 일정한 크기의 그룹으로 그룹핑하고, 같은 그룹에 있는 트랜잭션은 선점권을 인정함으로써 자원을 점유하고 있는 트랜잭션에게 우선순위를 상속하여 트랜잭션의 재시작 비율을 낮춘다. 낮은 트랜잭션이 데이터를 장시간 잠금(lock)하는 것을 방지하기 위해서 그룹 우선순위를 적용한다. 상속에 의한 데드락 방지를 위해서 충돌전에 다른 데이터의 잠금여부를 검사한다. 성능을 평가하기 위해서 분산 데이터 베이스 시스템으로 시뮬레이션 환경을 구축하여 기존의 기법들과 성능을 비교하였다. 성능 비교 결과는 본 논문에서 제안하는 데이터 우선순위 상속 알고리즘이 기존의 상속 알고리즘과 데이터 우선순위 알고리즘 보다 성능이 우수함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.78-80
• /
• 1998

분산 데이터베이스 시스템에서 완료규약의 수행은 다수의 메시지의 교환과 로그 레코드를 하게 되는 데 이것은 통신비용과 I/O 비용을 증가시키고 시스템의 성능에 영향을 미친다. 현대의 네트워크와 시스템은 속도는 매우 빠르고, 신뢰할 수 있기 때문에 분산 트랜잭션은 대부분 연산을 성공적으로 수행하고 승인한 후에 완료될 가능성이 많다. 본 논문에서는 향상된 PC규약을 제안한다. PC 규약에서 완료규약 수행 전에 참여자 사이트에서 처리한 연산의 종류를 미리 알 수 있게 하여 규약 테이블에 등록한다. 따라서 읽기 전용 트랜잭션에 대한 메시지 비용을 줄일 수 있고 Initiation 레크드에 읽기 전용 트랜잭션의 정보를 삭제함으로 일기 전용 트랜잭션에 대한 Initiation 레코드 비용을 줄인다. 또한 갱신 트랜잭션에 대한 Initiation 레코드 비용을 줄였다.