Journal of the ACM (JACM)
Analysis of the Address Assignment Problem for Clustered Keys
Journal of the ACM (JACM)
Elements of Data Management Systems
ACM Computing Surveys (CSUR)
Information Systems in Perspective
ACM Computing Surveys (CSUR)
A formal system for information retrieval from files
Communications of the ACM
Multi-attribute retrieval with combined indexes
Communications of the ACM
Data manipulation and programming problems in automatic information retrieval
Communications of the ACM
UPLIFTS—University of Pittsburgh linear file tandem system
Communications of the ACM
The organization of structured files
Communications of the ACM
Non-uniform key distribution and address calculation sorting
ACM '66 Proceedings of the 1966 21st national conference
Automatic Information Organization and Retrieval.
Automatic Information Organization and Retrieval.
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Description and performance analysis of signature file methods for office filing
ACM Transactions on Information Systems (TOIS)
Partitioned signature files: design issues and performance evaluation
ACM Transactions on Information Systems (TOIS)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Signature files: design and performance comparison of some signature extraction methods
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Attribute based file organization in a paged memory environment
Communications of the ACM
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.02 |
A file structure designed to provide rapid, random access with minimum storage overhead is presented. Storage and retrieval are achieved by direct attribute combination-to-address transformation thereby negating the necessity for large file dictionaries or list-pointer structures. The attribute combination-to-address transformation is conceptually similar to key-to-address transformation techniques, but the transformation is not limited to operations on a single key but operates on the combination of several independent keys (or any subset of the combination) describing an item or request.A storage and retrieval system utilizing the combinatorial file structure is developed. Storage and retrieval results derived from a simulated document library of 4000 items are presented. The new file organization is shown to have marked value with respect to minimum storage overhead and high retrieval speed.