Organization of clustered files for consecutive retrieval
ACM Transactions on Database Systems (TODS)
Bounds on Storage for Consecutive Retrieval
Journal of the ACM (JACM)
Consecutive storage of relevant records with redundancy
Communications of the ACM
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Three Text-Join Algorithms
IEEE Transactions on Knowledge and Data Engineering
Record block allocation for retrieval on secondary keys
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
An attribute-based file organization for a relational database
ACM '76 Proceedings of the 1976 annual conference
Evaluation of combinatorial file organization schemes
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
Efficient BP Algorithms for General Feedforward Neural Networks
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Preemptive scheduling and antichain polyhedra
Discrete Applied Mathematics
User/system interface within the context of an integrated corporate data base
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Data compression procedures utilizing the similarity of data
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics
Journal of Computer and System Sciences
Counting the orderings for multisets in consecutive ones property and PQ-trees
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.23 |
The consecutive retrieval property is an important relation between a query set and record set. Its existence enables the design of an information retrieval system with a minimal search time and no redundant storage. Some important theorems on the consecutive retrieval property are proved in this paper. Conditions under which the consecutive retrieval property exists and remain invariant have been established. An outline for designing an information retrieval system based on the consecutive retrieval property is also discussed.