Abstract
As the server in mobile environments may not have any information about the state of its clients’ cache(stateless server), using broadcasting approach to transmit the list of updated data to numerous concurrent mobile clients is an attractive approach. In this paper, a new concurrency control protocol is proposed to reduce aborts of concurrent transactions. The proposed protocol can improve the throughput of transactions by increasing the number of transactions which can be committed by the server during the same broadcasting interval. For this, with the proposed protocol, the server delays the certification of transactions until the next broadcasting point. The protocol adopts adaptive broadcasting as the way of sending invalidation reports, which shows stable performance by choosing appropriate broadcasting strategy between synchronous and asynchronous broadcastings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
D. Barbara, “Certification Reports: Supporting Transactions in Wireless Systems,” in Proceedings of IEEE International Conference on Distributed Computing Systems, 1997, pp.466–473.
I. Chung, J. Ryu, and C.-S. Hwang, “Efficient Cache Management Protocol Based on Data Locality in Mobile DBMSs,” in Concurrent Issues in Databases and Information Systems, Proceedings of ADBIS-DASFAA, LNCS 1884, Springer Verag, 2000, pp.51–64.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, I., Chong-Sun, H. (2001). Increasing Concurrency of Transactions Using Delayed Certification in Mobile DBMSs. In: Tan, KL., Franklin, M.J., Lui, J.CS. (eds) Mobile Data Management. MDM 2001. Lecture Notes in Computer Science, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44498-X_27
Download citation
DOI: https://doi.org/10.1007/3-540-44498-X_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41454-4
Online ISBN: 978-3-540-44498-5
eBook Packages: Springer Book Archive