Organization and Maintenance of Large Ordered Indices
a balanced tree with a page-sized node
Read it
EnglishTiếng Việt (abstract only)
- 12 sections
- 0 figures
- 0 equations
- 5 references
- cited by 1 here
- difficulty 3 of 5
- the publisher's page
Contents
- 1Introduction
- 2**B-Trees**
- 3The Data Structure and Retrieval Algorithm
- 4Key Insertion
- 5Cost of Retrievals and Insertions
- 6Deletion Process
- 7Cost of Deletions
- 8Page Overflow and Storage Utilization
- 9Maintenance Cost for Index with Insertions and Deletions
- 10Choice of k
- 11Experimental Results