Highly concurrent cache consistency for indices in client-server database systems
- 1 June 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 26 (2) , 50-61
- https://doi.org/10.1145/253262.253269
Abstract
In this paper, we present four approaches to providing highly concurrent B + -tree indices in the context of a data-shipping, client-server OODBMS architecture. The first performs all index operations at the server, while the other approaches support varying degrees of client caching and usage of index pages. We have implemented the four approaches, as well as the 2PL approach, in the context of the SHORE OODB system at Wisconsin, and we present experimental results from a performance study based on running SHORE on an IBM SP2 multicomputer. Our results emphasize the need for non-2PL approaches and demonstrate the tradeoffs between 2PL, no-caching, and the three caching alternatives.Keywords
This publication has 9 references indexed in Scilit:
- Adaptive, fine-grained sharing in a client-server OODBMSACM Transactions on Database Systems, 1997
- Shoring up persistent applicationsPublished by Association for Computing Machinery (ACM) ,1994
- The ObjectStore database systemCommunications of the ACM, 1991
- Cache consistency and concurrency control in a client/server DBMS architecturePublished by Association for Computing Machinery (ACM) ,1991
- Data caching tradeoffs in client-server DBMS architecturesPublished by Association for Computing Machinery (ACM) ,1991
- Concurrent search structure algorithmsACM Transactions on Database Systems, 1988
- Scale and performance in a distributed file systemACM Transactions on Computer Systems, 1988
- Concurrent operations on B∗-trees with overtakingJournal of Computer and System Sciences, 1986
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981