B-Trees with Lazy Parent Split

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]  Michael J. Carey,et al.  Performance of B-Tree Concurrency Algorithms , 1991, SIGMOD Conference.

[2]  Kurt Mehlhorn,et al.  The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees , 1982, Inf. Control..

[3]  Alexandros Biliris,et al.  Operation-specific locking in balanced structures , 1989, Inf. Sci..

[4]  Arnold L. Rosenberg,et al.  Time- and space-optimality in B-trees , 1981, TODS.

[5]  Derick Wood,et al.  Concurrency control in database structures with relaxed balance , 1987, PODS '87.

[6]  Eljas Soisalon-Soininen,et al.  Uncoupling updating and rebalancing in chromatic binary search trees , 1991, PODS '91.

[8]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[9]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[10]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[11]  Dennis Shasha,et al.  The performance of current B-tree algorithms , 1993, TODS.

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[13]  Gio Wiederhold,et al.  Concurrent use of B-trees with variable-length entries , 1988, SGMD.

[14]  Ricardo A. Baeza-Yates,et al.  Performance of B+-Trees with Partial Expansions , 1989, IEEE Trans. Knowl. Data Eng..

[15]  B. Srinivasan,et al.  An Adaptive Overflow Technique to Defer Splitting in B-Trees , 1991, Computer/law journal.

[16]  Michael J. Quinn,et al.  Designing Efficient Algorithms for Parallel Computers , 1987 .