Concurrency in extendible hashing
- 31 December 1988
- journal article
- Published by Elsevier in Information Systems
- Vol. 13 (1) , 97-109
- https://doi.org/10.1016/0306-4379(88)90030-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Concurrency control in a dynamic search structureACM Transactions on Database Systems, 1984
- Bounded index exponential hashingACM Transactions on Database Systems, 1983
- A New Method for Concurrency in B-TreesIEEE Transactions on Software Engineering, 1982
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- Concurrent Search and Insertion in AVL TreesIEEE Transactions on Computers, 1980
- Concurrent search and insertion in 2?3 treesActa Informatica, 1980
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Concurrency of operations on B-treesActa Informatica, 1977