title: Implementing Deletion in B+-trees
creator: Jannink, J.
subject: Miscellaneous
description: 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.
publisher: Stanford InfoLab
date: 1995
type: Techreport
type: NonPeerReviewed
format: application/pdf
identifier: http://ilpubs.stanford.edu:8090/85/1/1995-19.pdf
identifier: Jannink, J. (1995) Implementing Deletion in B+-trees. Technical Report. Stanford InfoLab. (Publication Note: SIGMOD RECORD, v.24, n.1, p.33-38, 1995)
relation: http://ilpubs.stanford.edu:8090/85/