Timestamp based concurrency control in broadcast disks environment

Authors:
Sungjun Lim;Haengrae Cho
Affiliations:
Department of Computer Engineering, Yeungnam University, Gyungsan, Gyungbuk, Republic of Korea;Department of Computer Engineering, Yeungnam University, Gyungsan, Gyungbuk, Republic of Korea
Venue:
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Year:
2004

Citing 9
Cited 1

Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient concurrency control for broadcast environments

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Read-only transactions in a distributed database

ACM Transactions on Database Systems (TODS)
Client-server computing in mobile environments

ACM Computing Surveys (CSUR)
Mobile data and transaction management

Information Sciences—Informatics and Computer Science: An International Journal
Exploiting Versions for Handling Updates in Broadcast Disks

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Multiversion Data Broadcast Organizations

ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Scalable Invalidation-Based Processing of Queries in Broadcast Push Delivery

ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
On the Performance of Transaction Processing in Broadcast Environments

MDA '99 Proceedings of the First International Conference on Mobile Data Access

Efficient Dissemination of Transaction-Consistent Data in Broadcast Environments

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcast disks are suited for disseminating information to a large number of clients in mobile computing environments. In this paper, we propose a timestamp based concurrency control (TCC) to preserve the consistency of read-only client transactions, when the values of broadcast data items are updated at the server. The TCC algorithm is novel in the sense that it can reduce the abort ratio of client transactions with minimal control information to be broadcast from the server. This is achieved by allocating the timestamp of a broadcast data item adaptively so that the client can allow more serializable executions with the timestamp. Using a simulation model of mobile computing environment, we show that the TCC algorithm exhibits substantial performance improvement over the previous algorithms.