• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.24-31
• /
• 2001

In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.

• Journal of Information Technology Applications and Management
• /
• v.11 no.1
• /
• pp.53-67
• /
• 2004

We propose an advanced transaction scheduling protocol to improve the concurrency and to guarantee the mobility for the mobile database management systems. Mobility, portability, and wireless link In mobile computing environment can cause certain drawbacks, and thus it is more difficult to solve the concurrency control problems. However, a locking scheme should be used to guarantee the data consistency and to prevent the data conflicts. It is well known that data consistency is guaranteed by standard transaction scheduling schemes like two-phase locking (2PL). It has two of operation, lock and unlock. But 2PL does not give solution for mobile system. Altruistic Locking (AL) and classifying transactions, we adapt, can give solution for the previous problems. AL, as an advanced protocol, has attempted to reduce delay effects associated with lock release moment by the use of donation. In this paper, we extend those approaches and classify the transactions to reduce delay effects of short-lived transaction caused by long-lived transaction. In addition, we show efficient solution for the case of disconnection occurrence. Our protocol, namely, Mobile Altruistic Locking (MAL) is shown to be efficiently used in order to reduce delay effects and to guarantee database consistency in a state of the slippery connection in mobile database systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1891-1898
• /
• 1999

Traditional syntax-oriented serializability notions are considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in distributed database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of oncurrency and average transaction waiting time.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3447-3455
• /
• 1999

Database correctness is guaranteed by standard transaction scheduling schemes like two-phase locking for the context of concurrent execution environment in which short-lived ones are normally mixed with long-lived ones. Traditional syntax-oriented serializability notions are considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in distributed database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.1-10
• /
• 2000

Traditional syntax-oriented serializability notions ate considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in client-server database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.235-242
• /
• 2002

We propose an advanced transaction scheduling protocol for concurrency control of multilevel secure databases in wireless mobile network environment. Wireless communication is characterized by frequent spurious disconnections. So short-lived transaction must quickly access database without any delay by long-lived one. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure databases in wireless mobile network environment. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of a1truism has also been deployed for extended a1truistic locking. This is in a way that scope of data to he early released is enlarged to include even data initially not intended to be donated. Our protocol is based on extended altruistic locking, but a new method, namely bi-directional donation locking for multilevel secure databases (MLBiDL), is additionally used in order to satisfy security requirements and concurrency. We showed the Simulation experiments that MLBiDL outperforms the other locking protocols in terms of the degree of throughput and average waiting time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.22-31
• /
• 2003

Traditional concurrency control strategies for database system are inappropriate for mobile computing environments in which communication disconnection could occur frequently. The time available to access transactions may be extremely limited in mobile computing. In order to ensure that this time is utilized most effectively, the short-lived transactions must be a main stream of transactions. Service handoffs which occur due to communication disconnection, could degrade the performance of mobile transactions especially for short-lived transactions. Altruistic locking protocol is in its nature favorable to short-lived transactions since it applies the donation of locks to long-lived transactions as early as possible. Performance for short-lived transactions could be improved when we applied altruistic locking to mobile computing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.101-104
• /
• 2001

데이터베이스에서 트랜잭션의 처리량을 향상시키기 위해서 기존의 문법 위주의 직렬성 이론으로는 단위시간당 처리량을 높이기는 힘든 형편이다. 이를 위하여 이타적 잠금 기법(altruistic locking: AL)은 트랜잭션이 객체를 사용한 다음 더 이상 그 객체를 요구하지 않을 때 다른 트랜잭션들이 그 객체를 로크할 수 있도록 미리 객체에 대한 로크를 해제함으로써 트랜잭션들의 대기시간을 줄이고 처리량을 향상시키기 위한 취지에서 제안된 것이다. 확장형 이타적 잠금(extended altruistic locking: XAL)기법은 AL 을 자취의 확장한 것으로 AL 이 근본적으로 안고 있는 반드시 기부된 객체만을 처리해야 한다는 제약을 완화한 기법이다. 본 논문에서는 분산 데이터베이스 환경하에서 장기 트랜잭션으로 인한 단기 트랜잭션의 대기현상을 최소화하도록 함으로써 동시성 제어의 정도를 높일 수 있는 새로운 확장형 이타적 잠금 기법인 양방향 기부기법(two-way donation locking: 2DL)을 제안하고 기존의 제어기법과 비교하였다. 모의실험에 의한 성능평가 결과 2DL 은 작업 처리율과 트랜잭션의 평균 대기시간 면에서 우수한 결과를 나타내었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1511-1514
• /
• 2003

본 논문에서는 모바일 데이터베이스 시스템에서 동시성제어의 정도를 높이고자 새로운 프로토콜을 제안한다. 트랜잭션의 동시성제어를 하는데 있어서 다중적인 접근으로부터 문제시되는 데이터 일관성을 보장하고, 대역폭이 낮은 모바일 환경 속에서 일어날 수 있는 잦은 접속 단절과 잦은 이동에 대한 트랜잭션 처리의 효율을 높이고자 한다. 2PL(two-phase locking)로부터 확장된 프로토콜인 XAL(extended altruistic locking)모델의 연장으로서 양방향(Bi-directional) 기부연산에 따른 트랜잭션의 처리와 트랜잭션을 판독전용과 판독 및 갱신용 트랜잭션의 두 가지로 분류함으로서 이동 컴퓨터 환경에서 단기 트랜잭션의 처리성능의 정도를 높이고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.161-164
• /
• 2004

모바일 컴퓨팅 환경에서 실시간 데이터베이스 시스템의 트랜잭션 처리시 2PL-HP 방법은 성능이 우수한 스케줄링 기법이다. 그러나 2PL-HP 방법은 높은 우선순위를 갖는 트랜잭션의 선행처리를 항상 보장하기 때문에 낮은 우선순위를 갖는 트랜잭션은 철회 및 블로킹이 불가피하여 기아(starvation) 현상을 초래한다. 본 논문은 이러한 기아 현상으로 인한 낮은 우선순위를 갖는 트랜잭션의 기다림과 철회를 최소화 하기 위해 이타적 잠금 기법에 우선 순위 기법과 2 버전 기법을 이용하였다. 데이터항목을 점유한 트랜잭션이 더 이상 그 데이터항목을 필요로 하지 않을 때 그 데이터항목을 기부함으로 우선순위가 낮은 트랜잭션들의 불필요한 재 시작 및 기다림을 방지한다. 이로써 마감시간 초과비율과 재시작 비율을 감소 시킬 수 있어 시스템의 처리율을 향상 시킬 수 있다.