The Influence of Data Base Characteristics and Usage on Direct Access File Organization
Journal of the ACM (JACM)
Analysis and performance of inverted data base structures
Communications of the ACM
A formal system for information retrieval from files
Communications of the ACM
Probabilistic models of inverted file information retrieval systems
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
File organizations & incrementally specified queries
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Uniform organization of inverted files
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
| Hi-index | 0.00 |
In an inverted file system a query is in the form of a Boolean expression of index terms. In response to a query the system accesses the inverted lists corresponding to the index terms, merges them, and selects from the merged list those records that satisfy the search logic. Considered in this paper is the problem of determining a Boolean expression which leads to the minimum total merge time among all Boolean expressions that are equivalent to the expression given in the query. This problem is the same as finding an optimal merge tree among all trees that realize the truth function determined by the Boolean expression in the query. Several algorithms are described which generate optimal merge trees when the sizes of overlaps between different lists are small compared with the length of the lists.