A concurrency control mechanism based on extendible hashing for main memory database systems
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A superior two-phase locking algorithm and its performance
Information Sciences: an International Journal
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Extendible hashing for concurrent operations and distributed data
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent Operations in Extendible Hashing
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A compendium of key search references
ACM SIGIR Forum
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
| Hi-index | 48.22 |
Extendible hashing is a dynamic data structure which accommodates expansion and contraction of any stored data efficiently. In this article, an algorithm has been developed for managing concurrent operations on extendible hashing by achieving optimal memory utilization by supporting directly expansion and contraction, page split, and merge. The results of this study have been encouraging in the sense that it seems to provide a higher degree of concurrency compared to other algorithms on an extendible hash file.