The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Computing Surveys (CSUR)
Randomized binary search technique
Communications of the ACM
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
A compendium of key search references
ACM SIGIR Forum
ACM Computing Surveys (CSUR)
A Cost Model for the Internal Organization of B+-Tree Nodes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A note on virtual memory indexes
Communications of the ACM
Jump searching: a fast sequential search technique
Communications of the ACM
A mathematical modeling approach to the automatic selection of database designs
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
| Hi-index | 48.25 |
A class of index structures for use in a virtual memory environment is described. Design alternatives within this class of index structures are analyzed. These alternatives include a choice of search strategy, whether or not pages in the index are stuctured, and whether or not keys are compressed. The average cost of retrieving entries from these indexes is expressed as a weighted sum of the cost of a basis key comparison and the cost of crossing a page boundary in the index structure. Formulas for the retrieval costs possible combinations of design alternatives are given. These are used in numerical case studies which compare the retrieval costs of the alternatives. Qualitative comparisons of the maintenance costs (insertion, deletion, reorganization) of the design alternatives are also included.