Browse > Article

Exploitation of Multi-Versions based on Callback Locking in a Client-Server DBMS Environment  

강흠근 (우송공업대학 전자계산과)
민준기 (한국과학기술원 전산학과)
전석주 (서울대학교 컴퓨터교육과)
정진완 (한국과학기술원 전산학과)
Publication Information
Journal of KIISE:Databases / v.31, no.5, 2004 , pp. 457-467 More about this Journal
Abstract
The efficiency of algorithms managing data caches has a major impact on the performance of systems that utilize client-side data caching. In these systems, two versions of data can be maintained without an additional space overhead of the server by exploiting the replication of data in the server's buffer and clients' caches. In this paper, we present a new cache consistency algorithm employing versions: Two Versions-Callback Locking (2V-CBL). Our experimental results indicate that 2V-CBL provides good performance, particularly outperforms a leading cache consistency algorithm, Asynchronous Avoidance-based Gache Consistency, when some clients run only read-only transactions.
Keywords
client/server; cache consistency; concurrency control; transactions;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P.A. Bernstein, V. Hadzilacos, and N. Goodman, 'Concurrency Control and Recovery in Database Systems,' Addison-Wesley, 1987
2 D. Agrawal and S. Sengupta, 'Modular Synchronization in Distributed, Multiversion Databases: Version Control and Concurrency Control,' IEEE Transactions on Knowledge and Data Engineering, vol. 5, num. 4, pp. 126-137, 1993   DOI   ScienceOn
3 M. Zaharioudakis and M.J. Carey, 'Hierarchical, Adaptive Cache Consistency in a Page Server OODBMS,' IEEE Transactions on Computers, vol 47, num. 4, pp. 427-444, 1998   DOI   ScienceOn
4 E. Panagos and A. Biliris, 'Synchronization and Recovery in a Client-Server Storage System,' The VLDB Journal, vol. 6, num. 3, pp. 209-223, 1997   DOI
5 G. Hughes, 'Scalability of Avoidance-Based Transactional Cache Consistency,' Proc. 6th IDEA Workshop, pp. 51-56, 1999
6 M. Zaharioudakis, M.J. Carey, and M.J. Franklin, 'Adaptive, Fine-Grained Sharing in a Client-Server OODBMS: A Callback-Based Approach,' ACM Transactions on Database Systems, vol. 22, num. 4, pp. 570-627, 1997   DOI   ScienceOn
7 B. Liskov, M. Castro, L. Shrira, and A. Adya, 'Providing Persistent Objects in Distributed Systems,' Proc. 13th European Conference on Object-Oriented Programming, pp. 230-257, 1999
8 A. Adya, R. Gruber, B. Liskov, and U. Maheshwari, 'Efficient Optimistic Concurrency Control Using Loosely Synchronous Clocks,' ACM SIGMOD Conference, pp. 23-34, June, 1995
9 M.J. Carey, M.J. Franklin, and M. Zaharioudakis, 'Fine-Grained Sharing in a Page Server OODBMS,' ACM SIGMOD Conference, pp. 359-370, June, 1994   DOI
10 M.T. Ozsu, K. Voruganti, and R.C. Unrau, 'An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs,' Proceedings of the 24th VLDB Conference, pp. 440-451, 1998
11 Y. Wang and L. Rowe, 'Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture,' ACM SIGMOD Conference, pp. 367-376, June, 1991   DOI
12 M. Franklin, M. Carey and M. Livny, 'Transactional Client-Server Cache Consistency: Alternatives and Performance,' ACM Trans. on Database Syst., Vol.22, No.3, pp.315-363, 1997   DOI   ScienceOn
13 C. Osthoff, C. Bentes, D. Ariosto, M. Mattoso, and C.L. Amorim, 'Evaluating the DSMIO Cache-Coherence Algorithm in Cluster-Based Parallel ODBMS,' 8th International Conference on OOIS, pp. 286-297, 2002
14 M. J. Carey, M. J. Franklin, M. Livny, and E. J. Shekita. 'Data Caching Tradeoffs in Client-Server DBMS Architectures'. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 357-366, Denver, Colorado, May 1991. Also available as Technical Report '#994, Comp. Sci. Dept., University of Wisconsin-Madison, Jan. 1991   DOI
15 Z. Tari, H. Hamidjadja, 'A CORBA Cooperative Cache Approach with Popularity Admission and Routing Mechanism,' Thirteenth Australasian Database Conference Australasian Database Conference, 2002   DOI
16 Z. Tari, Q.T. Lin, and H. Hamidjaja, 'Cache Management in CORBA Distributed Object Systems,' IEEE Concurrency, vol. 8, num. 3, pp. 48-55, 2000   DOI   ScienceOn