Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
ACM Transactions on Database Systems (TODS)
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Concurrent operations on extendible hashing and its performance
Communications of the ACM
Performance comparison of extendible hashing and linear hashing techniques
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Simulation Data Structures for Parallel Resource Management
IEEE Transactions on Software Engineering
Split-ordered lists: Lock-free extensible hash tables
Journal of the ACM (JACM)
Web Interact: An e-Learning Support System
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Experience distributing objects in an SMMP OS
ACM Transactions on Computer Systems (TOCS)
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Parallel implementations of Brunotte's algorithm
Journal of Parallel and Distributed Computing
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
| Hi-index | 0.02 |
The extendible hash file is a dynamic data structure that is an alternative to B-trees for use as a database index. While there have been many algorithms proposed to allow concurrent access to B trees similar solutions for extendible hash files have not appeared. In this paper, we present solutions to allow for concurrency that are based on locking protocols and minor modifications in the data structure.Another question that deserves consideration is whether these indexing structures can be adapted for use in a distributed database. Among the motivations for distributing data are increased availability and ease of growth, however, unless data structures in the access path are designed to support those goals, they may not be realized. We describe some first attempts at adapting extendible hash files for distributed data.