Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1145/202660.202666 | SIGMOD Record |
Keywords | Field | DocType |
lesser importance,complete b,c programming language,key deletion,tree library,implementing deletion,insertion algorithm,greater complexity | Programming language,SGML,Computer science,Pseudocode,C programming language,Flowchart,Database,Object oriented databases | Journal |
Volume | Issue | Citations |
24 | 1 | 27 |
PageRank | References | Authors |
2.82 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Jannink | 1 | 124 | 21.72 |