An Efficient Altruistic Looking Protocol for the Mobile Transaction Management System

이동 데이터베이스 시스템을 위한 효율적인 이타적 잠금기법

  • 권혁신 (성균관대학교 정보통신공학부 컴퓨터공학과) ;
  • 김세윤 (성균관대학교 정보통신공학부 컴퓨터공학과) ;
  • 김응모 (성균관대학교 정보통신공학부 컴퓨터공학과)
  • Published : 2004.03.01

Abstract

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.

Keywords