Secondary key retrieval using an IBM 7090-1301 system
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Reactive consistency control in deductive databases
ACM Transactions on Database Systems (TODS)
Data structures for dynamic queries: an analytical and experimental evaluation
AVI '94 Proceedings of the workshop on Advanced visual interfaces
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
The use of normal multiplication tables for information storage and retrieval
Communications of the ACM
An encoding method for multifield sorting and indexing
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
Retrieval—Update speed tradeoffs using combined indices
Communications of the ACM
Elements of the randomized combinatorial file structure
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
HyperFile: a data and query model for documents
The VLDB Journal — The International Journal on Very Large Data Bases
Function Materialization in Object Bases: Design, Realization, and Evaluation
IEEE Transactions on Knowledge and Data Engineering
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Indexing in a Hypertext Database
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Retrieval efficiency using combined indices
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
From Information System to Decision Support System
Transactions on Rough Sets IX
Storage structure and physical data independence
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
YARS2: a federated repository for querying graph structured data from the web
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.30 |
In this paper a file organization scheme designed to replace the use of the popular secondary index filing scheme (or inverted files on secondary key fields) is described. Through the use of redundancy and storing keys (or access numbers of the records) that satisfy different combinations of secondary index values in “buckets,” it is possible to retrieve all keys satisfying any input query derived from a subset of fields by a single access to an index file, although each bucket may be used for many combinations of values and a combination of buckets may be required for a given query.The method which, in its degenerate case, becomes the conventional secondary index filing scheme works similarly but has the following advantages: (1) the elimination of multiple accesses in many cases; (2) the elimination of false drops; (3) the elimination of computer time to perform intersection of key sets each qualified for one secondary index field only; and (4) the avoidance of long strings of keys when an index field appearing in a query has very few possible values. Redundancy, in some cases, is the same as the secondary indexing method. In the general case, trade-off between the number of accesses for query and redundancy exists.