The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Survey of Indexing Techniques for Sparse Matrices
ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
A formal system for information retrieval from files
Communications of the ACM
Design of tree structures for efficient querying
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Canonical structure in attribute based file organization
Communications of the ACM
Secondary key retrieval using an IBM 7090-1301 system
Communications of the ACM
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
Storing text retrieval systems on CD-ROM: compression and encryption considerations
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Improved hierarchical bit-vector compression in document retrieval systems
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
The traditional file structures used to support fast response to complex user queries have been based on the inverted list organization, using either the pointer or bit string representation. In this paper, the use of bit maps for executing multiple key searches is studied. Bit maps turn out to be less precise inverted lists Where the inversion is kept for a quantization of attribute domains and the objects referenced are blocks of data records. The goal is to reduce the total number of I/O accesses required to execute a retrieval based on a Boolean qualification. An evaluation of the method is given for both storage space and expected retrieval time under simplified assumptions. Key Words and Phrases: Multiple key retrieval, inverted lists, bit strings, bit maps, Boolean queries, data base management. CR Categories: 3.70, 3.71, 3.73, 3.74, 4.33, 4.34