The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Influence of Data Base Characteristics and Usage on Direct Access File Organization
Journal of the ACM (JACM)
Elements of Data Management Systems
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
A formal system for information retrieval from files
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Comparative Study of Very Large Data Bases
Comparative Study of Very Large Data Bases
Some techniques and trade-offs affecting large data base retrieval times
ACM '69 Proceedings of the 1969 24th national conference
A comparative study of very large data bases.
A comparative study of very large data bases.
Dynamic information and library processing
Dynamic information and library processing
Database performance evaluation in an indexed file environment
ACM Transactions on Database Systems (TODS)
A model of the performance of a rollback algorithm
ACM '79 Proceedings of the 1979 annual conference
| Hi-index | 0.00 |
An inverted data base organization is analyzed. The inverted directory is viewed realistically as another large data base. Algorithms and formulations are derived to estimate the average number of accesses for insertion, retrieval and deletion of items from the data base. An average load time is also presented for the inverted data base.