Analysis of index-sequential files with overflow chaining
- 1 December 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 6 (4) , 671-680
- https://doi.org/10.1145/319628.319665
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- On random 2?3 treesActa Informatica, 1978
- Analysis of indexed sequential and direct access file organizationsPublished by Association for Computing Machinery (ACM) ,1976
- VSAM data set design parametersIBM Systems Journal, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- An improved index sequential access method using hashed overflowCommunications of the ACM, 1972
- File Organization: On the Selection of Random Access Index Points for Sequential FilesJournal of the ACM, 1969