论文信息 - Implementing deletion in B+-trees

Implementing deletion in B+-trees

This paper describes algorithms for key deletion in B+-trees. There are published algorithms and pseudocode for searching and inserting keys, but deletion, due to its greater complexity and perceived lesser importance, is glossed over completely or left as an exercise to the reader. To remedy this situation, we provide a well documented flowchart, algorithm, and pseudo-code for deletion, their relation to search and insertion algorithms, and a reference to a freely available, complete B+-tree library written in the C programming language.

Jan Jannink | J. Jannink

[1] Betty Salzberg,et al. File Structures: An Analytic Approach , 1988 .

[2] Dennis Shasha,et al. Utilization of B-trees with inserts, deletes and modifies , 1989, PODS '89.

[3] Andreas Reuter,et al. Transaction Processing: Concepts and Techniques , 1992 .

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

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

[6] Michael J. Folk. File Structures , 1987 .

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

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

[9] Dennis Shasha,et al. B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half , 1993, J. Comput. Syst. Sci..

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

[11] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

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

[13] Panos E. Livadas. File structures: theory and practice , 1990 .

[14] Ian Oliver. Programming classics - implementing the world's best algorithms , 1994 .

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