Thumbnail
Access Restriction
Subscribed

Author McCreight, Edward M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Searching ♦ Database ♦ B-tree ♦ Storage structure ♦ Tree ♦ Index
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.
Description Affiliation: Xerox Palo Alto Research Center, Palo Alto, CA (McCreight, Edward M.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 9
Page Count 5
Starting Page 670
Ending Page 674


Open content in new tab

   Open content in new tab
Source: ACM Digital Library