Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Derivation of a parallel algorithm for balancing binary trees
IEEE Transactions on Software Engineering
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Cost-optimal parallel algorithms for constructing 2-3 trees
Journal of Parallel and Distributed Computing
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
An introduction to parallel algorithms
An introduction to parallel algorithms
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Maintaining B-trees on an EREW PRAM
Journal of Parallel and Distributed Computing
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
Parallel algorithms for red-black trees
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parallel Dictionaries in 2-3 Trees
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The B-tree is a fundamental data structure that is used to access and update a large number of keys. In this paper we present a parallel algorithm on the EREW PRAM that deletes keys in a B-tree. Our algorithm runs in O(t (log k + log t n )) time with k processors, where n is the number of keys in the B-tree, t is the minimum degree of the B-tree, and k is the number of unsorted keys to delete, and it improves upon the previous algorithm by a factor of t .