Concurrent operations on B∗-trees with overtaking
- 31 October 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 33 (2), 275-296
- https://doi.org/10.1016/0022-0000(86)90021-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Concurrency control in a dynamic search structureACM Transactions on Database Systems, 1984
- Extendible hashing for concurrent operations and distributed dataPublished by Association for Computing Machinery (ACM) ,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 2?3 treesActa Informatica, 1980
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Concurrency of operations on B-treesActa Informatica, 1977
- B-trees in a system with multiple usersInformation Processing Letters, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972