Optimizing Jan Jannink's Implementation of B+-tree deletion

Authors:
R. Maelbrancke;H. Olivié
Affiliations:
Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan, 200A, B-3001 Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan, 200A, B-3001 Heverlee, Belgium
Venue:
ACM SIGMOD Record
Year:
1995

Citing 7
Cited 2

Files & databases: an introduction

Files & databases: an introduction
Data structures, algorithms, and performance

Data structures, algorithms, and performance
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Implementing deletion in B+-trees

ACM SIGMOD Record
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
File Structures Using Pascal

File Structures Using Pascal
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs

Batch-construction of B+-trees

Proceedings of the 2001 ACM symposium on Applied computing
An efficient B+-tree design for main-memory database systems with strong access locality

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we propose optimization strategies for the B+-tree deletion algorithm. The optimizations are focused on even order B+-trees and on the reduction of the number of block accesses.