Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Maintaining consistency of client-cached data
Proceedings of the sixteenth international conference on Very large databases
Proceedings of the sixteenth international conference on Very large databases
Data caching tradeoffs in client-server DBMS architectures
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Cache consistency and concurrency control in a client/server DBMS architecture
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The ObjectStore database system
Communications of the ACM
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Adaptive, fine-grained sharing in a client-server OODBMS: a callback-based approach
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Relaxed Index Consistency for a Client-Server Database
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Cache investment: integrating query optimization and distributed data placement
ACM Transactions on Database Systems (TODS)
Selective-Splitting and Cache-Maintenance Algorithms for Associative-Client Caches
Distributed and Parallel Databases
B-tree concurrency control and recovery in page-server database systems
ACM Transactions on Database Systems (TODS)
Path conscious caching of B+ tree indexes in a shared disks cluster
Journal of Parallel and Distributed Computing
Maintaining cache coherency for b+ tree indexes in a shared disks cluster
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
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.