Massive concurrent deletion of keys in b*-tree

Authors:
S. Arash Ostadzadeh;M. Amir Moulavi;Zeinab Zeinalpour
Affiliations:
Computer Engineering Department, Islamic Azad University of Mashhad, Mashhad, Iran;Young Researchers Club, Islamic Azad University of Mashhad, Mashhad, Iran;Young Researchers Club, Islamic Azad University of Mashhad, Mashhad, Iran
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 15
Cited 0

Concurrent operations on B*-trees with overtaking

Journal of Computer and System Sciences
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
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Time- and space-optimality in B-trees

ACM Transactions on Database Systems (TODS)
Prefix B-trees

ACM Transactions on Database Systems (TODS)
Parallel Prefix Computation

Journal of the ACM (JACM)
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
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Pagination of B*-trees with variable-length records

Communications of the ACM
B+ trees and indexed sequential files: a performance comparison

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Effect of node size on the performance of cache-conscious B+-trees

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deleting keys of B-trees in parallel

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

B*-tree is an improved variant of well known B-tree data structure which has extensive applications in data storage and retrieval systems including parallel database systems. In this paper, we present an algorithm for deleting keys of B*-tree concurrently in the case that the number of to-be-deleted keys is more than a half of the total keys in the tree. The proposed algorithm can be implemented on CREW PRAM model in optimal O(log2n + BlogBn) time with the total processors equal to the keys to be deleted. n is the total number of keys in B*-tree and B is equal to half of the keys in an internal node containing maximum keys. It counts as an improvement upon the previous comparable known algorithms by a reduction of factor B in the (log2n)-term of the time complexity.