Communications of the ACM
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
ACM '67 Proceedings of the 1967 22nd national conference
Data base or data maze? An exploration of entry points
ACM '68 Proceedings of the 1968 23rd ACM national conference
Design of a multi-level file management system
ACM '66 Proceedings of the 1966 21st national conference
ACM '66 Proceedings of the 1966 21st national conference
Analysis of an inverted data base structure
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Analysis of storage structure performance for multiple data processing activities
ACM '76 Proceedings of the 1976 annual conference
Analysis of retrieval performance for selected file organization techniques
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Organization of a natural resources data bank system
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A data base management problem specification model
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 0.00 |
This paper presents a theoretical analysis of certain techniques for organizing large amounts of stored data to facilitate fast retrieval of desired information. The well-known access method involving the use of an inverted file to provide multi-keyword access to records is analyzed and shown to significantly reduce retrieval time at the cost of increased file maintenance time. It is shown that further improvements in retrieval time can result from exploiting several techniques for compacting the inverted file, including the use of a bit-pattern representation of the inverted file records. In addition, a direct keyword access method is introduced which avoids the use of a large disk resident concordance/index for locating disk resident information by maintaining a relatively small core resident table.