Abstract
Database systems have used a client-server computing model to support shared data in distributed systems such as Web systems. To reduce server bottlenecks, each client may have its own cache for later reuse. This paper suggests an efficient cache consistency protocol based on a optimistic approach. The main characteristic of our scheme is that some transactions that read stale data items can not be aborted, because it adopts a re-ordering mechanism to enhance the performance. This paper presents a simulation-based analysis on the performance of our scheme with other well-known protocols. The analysis was executed under the Zipf workload which represents the popularity distribution on the Web. The simulation experiments show that our scheme performs as well as or better than other schemes with low overhead.
This work was supported by Ministry of Education and Human Resources Development through Embedded Software Open Resource Center(ESORC) at SangMyung University.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pitoura, E., Chrysanthis, P.K.: Multiversion Data Broadcast. IEEE Transacions on Computers 51(10), 1224–1230 (2002)
Barbara, D.: Mobile Computing and Database - a Survey. IEEE Transactions on Knowledge and Data Engineering 11(1), 108–117 (1999)
Jing, J., Elmagarmid, A., Helal, A., Alonso, R.: Bit-Sequences: An Adaptive Cache Invalidation Method in Mobile Client/Server Environments. ACM/Baltzer Mobile Networks and Applications 2(2) (1997)
Fong, C.F., Lui, C.S., Wong, M.H.: Quantifying Complexity and Performance Gains of Distributed Caching in a Wireless Network Environment. In: Proceedings of the 13th International Conference on Data Engineering, pp. 104–113 (April 1997)
Gottemukkala, V., Omiecinski, E., Ramachandran, U.: Relaxed Consistency for a Client-Server Database. In: Proc. of International Conference on Data Engineering (February 1996)
Adya, A., Gruber, R., Liskov, B., Maheshwari, U.: Efficient optimistic concurrency control using loosely synchronized clocks. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 23–34 (1995)
Carey, M.J., Franklin, M.J., Livny, M., Shekita: Data caching tradeoffs in client-server DBMS architectures. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 357–366 (1991)
Franklin, M.J., Carey, M.J., Livny, M.: Local disk caching in client-server database systems. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 543–554 (1993)
Zipf, G.K.: Human Behavior and the Principles of Least Effort. Addison Wesley, Reading (1949)
Almeida, V., Bestavros, A., Crovella, M., Oliveira, A.D.: Characterizing reference locality in the WWW. In: Proceedings of the 1996 International Conference on Parallel and Distributed Information Systems (PDIS 1996), pp. 92–103 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, S., Bae, K.Y. (2005). Cache Management Protocols Based on Re-ordering for Distributed Systems. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_22
Download citation
DOI: https://doi.org/10.1007/11424758_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25860-5
Online ISBN: 978-3-540-32043-2
eBook Packages: Computer ScienceComputer Science (R0)