A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
Analysis of index-sequential files with overflow chaining
ACM Transactions on Database Systems (TODS)
The role of parellelism in file organization
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Interpolation search—a log logN search
Communications of the ACM
Quantitative evaluation of design tradeoffs in file systems
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
A balanced tree storage and retrieval algorithm
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A graduate course in database management
ACM SIGMOD Record
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.02 |
The construction of a hierarchy of indexes (the indexed sequential access method) is one means of providing rapid random access to sequential files. An examination is made of the consequences of partially or completely replacing one or more index levels by linear interpolation procedures. For all possible configurations of the several types of key distributions investigated, linear interpolation on the average provides significant performance improvements. Typically, the two accesses required to obtain track index and data are reduced to 1.1 to 1.7 accesses per record. Extremely unusual key distribution will, however, raise the number of accesses required above 2.