Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Generation and search of clustered files
ACM Transactions on Database Systems (TODS)
Semantic Clustering of Index Terms
Journal of the ACM (JACM)
Bounds on Storage for Consecutive Retrieval
Journal of the ACM (JACM)
File organization: the consecutive retrieval property
Communications of the ACM
Linear algorithms to recognize interval graphs and test for the consecutive ones property
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The SMART Retrieval System—Experiments in Automatic Document Processing
The SMART Retrieval System—Experiments in Automatic Document Processing
| Hi-index | 0.01 |
This paper studies the problem of storing single-level and multilevel clustered files. Necessary and sufficient conditions for a single-level clustered file to have the consecutive retrieval property (CRP) are developed. A linear time algorithm to test the CRP for a given clustered file and to identify the proper arrangement of objects, if CRP exists, is presented. For the single-level clustered files that do not have CRP, it is shown that the problem of identifying a storage organization with minimum redundancy is NP-complete.Consequently, an efficient heuristic algorithm to generate a good storage organization for such files is developed. Furthermore, it is shown that, for certain types of multilevel clustered files, there exists a storage organization such that the objects in each cluster, for all clusters in each level of the clustering, appear in consecutive locations.