article

Free access

Implementing deletion in B+-trees

Author:

Jan JanninkAuthors Info & Claims

ACM SIGMOD Record, Volume 24, Issue 1

Pages 33 - 38

https://doi.org/10.1145/202660.202666

Published: 01 March 1995 Publication History

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.

References

[1]

[AHU83] A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading MA, 1983.

Digital Library

[2]

[BM72] R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acts Informatica , 1:173-189, 1972.

Digital Library

[3]

[BY89] R. A. Baeza-Yates. Expected behaviour of B⁺- trees under random insertions. Acta Informatica , 26(5):439-471, 1989.

Digital Library

[4]

[CLR90] T. H. Cormen, C,. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990.

Digital Library

[5]

[Com79] D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.

Digital Library

[6]

[EN94] R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin / Cummings, Redwood City CA, second edition, 1994.

Digital Library

[7]

[FZ92] M. J. Folk and B. Zoellick. File Structures. Addison-Wesley, Reading MA, second edition, 1992.

Digital Library

[8]

[GR93] J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kauffman, 1993.

Digital Library

[9]

[GS78] L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pages 8-21. IEEE, 1978.

Digital Library

[10]

[JS89] T. Johnson and D. Shasha. Utilization of B-trees with inserts, deletes and modifies. In Proceedings of the 8th Symposium on Principles of Database Systems, pages 235-246. ACM, 1989.

Digital Library

[11]

[JS93a] T. Johnson and D. Shasha. B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half. Journal of Computer and System Sciences, 47(1):45-76, 1993.

Digital Library

[12]

[JS93b] T. Johnson and D. Shasha. The performance of current B-tree algorithms. ACM Transactions on Database Systems, 18(1):51-101, 1993.

Digital Library

[13]

[Knu73] D. E. Knuth. The Art of Computer Programming: Volume III. Addlson-Wesley, Reading MA, 1973.

[14]

[Liv90] P. Lividas. File Structures: Theory and Practice . Prentice Hall, Englewood Cliffs NJ, 1990.

Digital Library

[15]

[Oli93] I. Oliver. Programming Classics: Implementing the World's Best Algorithms. Prentice Hall, Englewood Cliffs NJ, 1993.

Digital Library

[16]

[Sal88] B. J. Salzberg. File Structures: an Analytic Approach. Prentice Hall, Englewood Cliffs NJ, 1988.

Digital Library

[17]

[Wir76] N. Wirth. Algorithms + Data Structures = Programs. Prentice Hall, Englewood Cliffs NJ, 1976.

Digital Library

[18]

[Woo93] D. Wood. Data Structures, Algorithms, and Performance. Addison-Wesley, Reading MA, 1993.

Digital Library

[19]

[ZH89] B. Zhang and M. Hsu. Unsafe operations in B-trees. Acta Informatica, 26(5):421-438, 1989.

Digital Library

Cited By

Lee BAn MLee S(2023)A Case for Space Compaction of B-Tree Nodes on Flash StorageIEEE Access10.1109/ACCESS.2023.326708411(38149-38156)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3267084
Sangat PTaniar DMessom C(2022)ATrie Group Join: A Parallel Star Group Join and Aggregation for In-Memory Column-StoresIEEE Transactions on Big Data10.1109/TBDATA.2020.30045208:4(1020-1033)Online publication date: 1-Aug-2022
https://doi.org/10.1109/TBDATA.2020.3004520
Papagiannis ASaloustros GXanthakis GKalaentzis GGonzalez-Ferez PBilas A(2021)KreonACM Transactions on Storage10.1145/341841417:1(1-32)Online publication date: 18-Jan-2021
https://dl.acm.org/doi/10.1145/3418414
Show More Cited By

Index Terms

Implementing deletion in B+-trees
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Physical data models
  2. Information storage systems
    1. Record storage systems
      1. Directory structures
        B-trees
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees

Recommendations

Deletion in two-dimensional quad trees

An algorithm for deletion in two-dimensional quad trees that handles the problem in a manner analogous to deletion in binary search trees is presented. The algorithm is compared with a proposed method for deletion which reinserts all of the nodes in the ...
Deletion Without Rebalancing in Binary Search Trees

We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect deletion rebalancing, and many B-tree--based database systems do not do it. We ...
Deletion without rebalancing in balanced binary trees
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect deletion rebalancing, and many database systems do not do it. We describe a ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 24, Issue 1

March 1995

97 pages

ISSN:0163-5808

DOI:10.1145/202660

Editor:
Arie Segev
Univ. of California, Berkeley

Issue’s Table of Contents

Copyright © 1995 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1995

Published in SIGMOD Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
2,920
Total Downloads

Downloads (Last 12 months)445
Downloads (Last 6 weeks)32

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lee BAn MLee S(2023)A Case for Space Compaction of B-Tree Nodes on Flash StorageIEEE Access10.1109/ACCESS.2023.326708411(38149-38156)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3267084
Sangat PTaniar DMessom C(2022)ATrie Group Join: A Parallel Star Group Join and Aggregation for In-Memory Column-StoresIEEE Transactions on Big Data10.1109/TBDATA.2020.30045208:4(1020-1033)Online publication date: 1-Aug-2022
https://doi.org/10.1109/TBDATA.2020.3004520
Papagiannis ASaloustros GXanthakis GKalaentzis GGonzalez-Ferez PBilas A(2021)KreonACM Transactions on Storage10.1145/341841417:1(1-32)Online publication date: 18-Jan-2021
https://dl.acm.org/doi/10.1145/3418414
Bogatov DKollios GReyzin L(2019)A comparative evaluation of order-revealing encryption schemes and secure range-query protocolsProceedings of the VLDB Endowment10.14778/3324301.332430912:8(933-947)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.14778/3324301.3324309
Busato FGreen OBombieri NBader D(2018)Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs2018 IEEE High Performance extreme Computing Conference (HPEC)10.1109/HPEC.2018.8547541(1-7)Online publication date: Sep-2018
https://doi.org/10.1109/HPEC.2018.8547541
Soe NThein TAung T(2018)GPS Tracking and Traffic Monitoring System in Urban Transportation2018 IEEE 7th Global Conference on Consumer Electronics (GCCE)10.1109/GCCE.2018.8574509(804-805)Online publication date: Oct-2018
https://doi.org/10.1109/GCCE.2018.8574509
Shaila SVadivel AShaila SVadivel A(2018)Cluster Indexing and GR Encoding with Similarity Measure for CBIR ApplicationsTextual and Visual Information Retrieval using Query Refinement and Pattern Analysis10.1007/978-981-13-2559-5_5(93-122)Online publication date: 30-Sep-2018
https://doi.org/10.1007/978-981-13-2559-5_5
Cui SZhang MAsghar MRussello G(2018)Long White Cloud (LWC): A Practical and Privacy-Preserving Outsourced DatabaseInformation Security Theory and Practice10.1007/978-3-319-93524-9_3(41-55)Online publication date: 21-Jun-2018
https://doi.org/10.1007/978-3-319-93524-9_3
Cherniak RZhu QGu YPramanik SDesai BHong J(2017)Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data SpacesProceedings of the 21st International Database Engineering & Applications Symposium10.1145/3105831.3105840(153-160)Online publication date: 12-Jul-2017
https://dl.acm.org/doi/10.1145/3105831.3105840
Arasu AEguro KKaushik RKossmann DMeng PPandey VRamamurthy RChirkova RYang JSuciu D(2017)ConcertoProceedings of the 2017 ACM International Conference on Management of Data10.1145/3035918.3064030(251-266)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3035918.3064030
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents