The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
File Organization: On the Selection of Random Access Index Points for Sequential Files
Journal of the ACM (JACM)
An improved index sequential access method using hashed overflow
Communications of the ACM
Database Design
Analysis of indexed sequential and direct access file organizations
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
A Physical Database Design Evaluation System for CODASYL Databases
IEEE Transactions on Software Engineering
Retrieval performance versus disc space utilization on WORM optical discs
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A compendium of key search references
ACM SIGIR Forum
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
The average time until bucket overflow
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The gradual performance deterioration caused by deletions from and insertions into an index-sequential file after loading is analyzed. The model developed assumes that overflow records are handled by chaining. Formulas for computing the expected number of overflow records and the expected number of additional accesses caused by the overflow records for both successful and unsuccessful searches are derived.