Stanford InfoLab Publication Server

Implementing Deletion in B+-trees

Jannink, J. (1995) Implementing Deletion in B+-trees. Technical Report. Stanford InfoLab. (Publication Note: SIGMOD RECORD, v.24, n.1, p.33-38, 1995)




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.

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:B+tree, Deletion, Pseudo-code
Related URLs:Project Homepage
ID Code:85
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:14 Jan 2009 14:30

Download statistics

Repository Staff Only: item control page