Estimating block accesses in a B^+-tree whose leaf records are of arbitrary size

DOI10.1016/S0306-4379(97)00018-5zbMATH Open0888.68052OpenAlexW2042860311MaRDI QIDQ1370940FDOQ1370940

Authors: Allaoua Maamir, W. I. Grosky 

Publication date: 11 December 1997

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0306-4379(97)00018-5

Recommendations

• Batched search of index sequential files
• Some average performance measures for the B-tree
• Variance of storage requirements for B+-trees
• Memory management for B-trees

zbMATH Keywords

batched searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

This page was built for publication: Estimating block accesses in a \(\text{B}^+\)-tree whose leaf records are of arbitrary size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370940)