Concurrent Maintenance of Binary Search Trees
- 1 November 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-10 (6), 777-784
- https://doi.org/10.1109/tse.1984.5010306
Abstract
The problem of providing efficient concurrent access for independent processes to a dynamic search structure is the topic of this paper. We develop concurrent algorithms for search, update, insert, and delete in a simple variation of binary search trees, called external trees. The algorithm for deletion, which is usually the most difficult operation, is relatively easy in this data structure. The advantages of the data structure and the algorithms are that they are simple, flexible, and efficient, so that they can be used as a part in the design of more complicated concurrent algorithms where maintaining a dynamic search structure is necessary. In order to increase the efficiency of the algorithms we introduce maintenance processes that independently reorganize the data structure and relieve the user processes of nonurgent operations. We also discuss questions of transactions in a dynamic environment and replicated copies of the data structure.Keywords
This publication has 13 references indexed in Scilit:
- Extendible hashing for concurrent operations and distributed dataPublished by Association for Computing Machinery (ACM) ,1983
- Concurrency control in a dynamic search structurePublished by Association for Computing Machinery (ACM) ,1982
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- On describing the behavior and implementation of distributed systemsTheoretical Computer Science, 1981
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- Concurrent search and insertion in 2?3 treesActa Informatica, 1980
- Notes on data base operating systemsPublished by Springer Nature ,1978
- Concurrency of operations on B-treesActa Informatica, 1977
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- B-trees in a system with multiple usersInformation Processing Letters, 1976