论文信息 - Optimizing Jan Jannink's Implementation of B+-tree deletion - 字舞流文

Optimizing Jan Jannink's Implementation of B+-tree deletion

In this note we propose optimization strategies for the B+-tree deletion algorithm. The optimizations are focused on even order B+-trees and on the reduction of the number of block accesses.

R. Maelbrancke | H. Olivie | H. Olivié | R. Maelbrancke

[1] Derick Wood,et al. Data structures, algorithms, and performance , 1992 .

[2] Ramez Elmasri,et al. Fundamentals of Database Systems , 1989 .

[3] Nancy E. Miller. File structures using Pascal , 1987 .

[4] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .

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

[6] Jan Jannink,et al. Implementing deletion in B+-trees , 1995, SGMD.

[7] Peter D. Smith,et al. Files & databases: an introduction , 1986 .

[8] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[9] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .