Abstract

A B-tree variant that postpones parent node splittings due to upcoming items until a later access of the same node is examined. This technique aims to decrease the possibility of propagating splittings to upper levels so that more concurrency is achieved. Insertion and deletion algorithms are given. Time and space performance results are also reported and comparison with conventional B-trees is carried out. It is shown that this technique substantially improves the performance of small degree B-trees so that, indeed, concurrency is enhanced. 1.

Citations

501	The ubiquitous B-tree - Comer - 1979
229	Organization and Maintenance of Large Ordered Indexes - Bayer, McCreight - 1972
212	A dichromatic framework for balanced trees - Guibas, Sedgewick - 1978
41	A symmetric concurrent b-tree algorithm - LANIN, SHASHA - 1986
34	Fife Organization for Database Design - Wiederhold - 1987
30	Algorithms and Data Structures - Wirth - 1985
29	Concurrency control in database structures with relaxed balance - Nurmi, Soisalon-Soininen, et al. - 1987
20	Uncoupling updating and rebalancing in chromatic binary search trees - Nurmi, Soisalon-Soininen - 1991
12	Performance of B + trees with partial expansions - Baeza-Yates, Larson - 1989
12	The theory of fringe analysis and its application to 2–3 trees and B–trees - Eisenbarth, Ziviani, et al. - 1982
6	Handbook of Data Structures and Algorithms - Gonnet - 1984
3	Designing Eficient Algorithms for Parallel Computers - Quinn - 1987
2	Concurrent use of B-trees with variable length entries - Keller, Wiederhold - 1988
2	Towards an optimal data-structure: CB-trees - Prabhakar, Sahasrabuddhe - 1984
2	An adaptive overflow technique to defer splitting in b-trees - Srinivasan - 1991
2	Performance of B-tree concurrency algorithms - Srinivasan, Carey - 1991
1	Operation specific locking in balanced structures, Iform. Sci - Biliris - 1989
1	Time- and space-optimality - Rosenberg, Snyder - 1981