Journal ArticleOPEN ACCESS

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

ACM SIGMOD Record (1995) 24(3) 5-7
DOI: 10.1145/211990.211999
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 1995, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Maelbrancke, R., & Olivié, H. (1995). Optimizing Jan Jannink’s Implementation of B+-tree Deletion. ACM SIGMOD Record, 24(3), 5–7. https://doi.org/10.1145/211990.211999

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free