A concurrency control scheme for mobile transactions in broadcast disk environments

被引:6
作者
Jung, Sungwon [1 ]
Choi, Keunha [2 ]
机构
[1] Sogang Univ, Dept Comp Sci, Seoul 121742, South Korea
[2] Samsung Elect Co Ltd, Div Mobile Commun, Gumi 730350, Gyeong Buk, South Korea
关键词
Mobile databases; Mobile transactions; Concurrency control; Wireless broadcast channels; Data dissemination; Broadcast data; Broadcast disks; Mobile computing; EFFICIENT;
D O I
10.1016/j.datak.2009.02.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Broadcast disk technique has been often used to disseminate frequently requested data efficiently to a large volume of mobile clients over wireless channels. In broadcast disk environments, a server often broadcasts different data items with differing frequencies to reflect the skewed data access patterns of mobile clients. Previously proposed concurrency control methods for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. These protocols perform poorly in broadcast disk environments where the data access patterns of mobile transactions are skewed. In broadcast disk environments, the time length of a broadcast cycle usually becomes large to reflect the skewed data access patterns. This will often cause read-only transactions to access old data items rather than the latest data items. Furthermore, updating mobile transactions will be frequently aborted and restarted in the final validation stage due to the update conflict of the same data items with high access frequencies. This problem will increase the average response time of the update mobile transactions and waste the uplink communication bandwidth. In this paper, we extend the existing FBOCC concurrency control method to efficiently handle mobile transactions with skewed data access patterns in broadcast disk environments. Our method allows read-only transactions to access the more updated data. and reduces the average response time of updating transactions through early aborts and restarts. Our method also reduces the amount of uplink communication bandwidth for the final validation of the update transactions. We present an in-depth experimental analysis Of Our method by comparing with existing concurrency control protocols. Our performance analysis shows that it significantly decreases the average response time and the amount of uplink bandwidths over existing methods. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:926 / 945
页数:20
相关论文
共 31 条
[1]  
Acharya Swarup., 1995, SIGMOD Conference, P199
[2]   Certification reports: Supporting transactions in wireless systems [J].
Barbara, D .
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1997, :466-473
[3]  
Bernstein P.A., 1987, Concurrency Control and Recovery in Database Systems
[4]  
Cho H, 2003, IEICE T COMMUN, VE86B, P3114
[5]  
CHUNG Y, 2003, P 9 IEEE WORKSH FUT, V28, P138
[6]  
*DIR NETW, 2006, MICR SMART PERS OBJ
[7]  
*DIRECTWAY, 2006, HUGH NETW SYST
[8]   Utilization of execution histories in scheduling real-time database transactions [J].
Dogdu, E .
DATA & KNOWLEDGE ENGINEERING, 2006, 57 (02) :148-178
[9]  
FORMAN GH, 1994, IEEE COMPUTER, V27
[10]  
HAERDER T, 1984, INFORM SYSTEMS, V9