Deleting keys of B-trees in parallel

Authors:
Heejin Park;Kunsoo Park;Yookun Cho
Affiliations:
College of Information and Communications, Hanyang University, Seoul 133-791, Republic of Korea;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Republic of Korea;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Republic of Korea
Venue:
Journal of Parallel and Distributed Computing
Year:
2004

Citing 21
Cited 1

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
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
Regular Article: Efficient rebalancing of chromatic search trees

Proceedings of the 30th IEEE symposium on Foundations of computer science
Parallel construction of (a, b)-trees

Journal of Parallel and Distributed Computing
Amortization results for chromatic search trees, with an application to priority queues

Journal of Computer and System Sciences
Group updates for relaxed height-balanced trees

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees

ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees

ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Making B+- trees cache conscious in main memory

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Parallel algorithms for red-black trees

Theoretical Computer Science
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
B-trees with relaxed balance

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multi-version memory: software cache management for concurrent B-trees

SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees

IEEE Transactions on Computers

Massive concurrent deletion of keys in b*-tree

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(B(logk+log"Bn)) time with k processors, where n is the number of keys in the B-tree, B 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 B.