Pagination of B*-trees with variable-length records

Authors:
Edward M. McCreight
Affiliations:
Xerox Palo Alto Research Center, Palo Alto, CA
Venue:
Communications of the ACM
Year:
1977

Citing 2
Cited 12

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs

Efficient optimal pagination of scrolls

Communications of the ACM
New applications of failure functions

Journal of the ACM (JACM)
A compendium of key search references

ACM SIGIR Forum
A simple balanced search tree

CSC '93 Proceedings of the 1993 ACM conference on Computer science
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Optimal pagination of B-trees with variable-length items

Communications of the ACM
WFS a simple shared file system for a distributed environment

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Polyline Spatial Join Evaluation Using Raster Approximation

Geoinformatica
LSH forest: self-tuning indexes for similarity search

WWW '05 Proceedings of the 14th international conference on World Wide Web
Performance guarantees for B-trees with different-sized atomic keys

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Massive concurrent deletion of keys in b*-tree

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Generic and efficient framework for search trees on flash memory storage systems

Geoinformatica

Quantified Score

Hi-index	48.25

Visualization

Abstract

A strategy is presented for pagination of B*-trees with variable-length records. If records of each length are uniformly distributed within the file, and if a wide distribution of record lengths exists within the file, then this strategy results in shallow trees with fast access times. The performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.