Abstract

The performance of distributed text document retrieval systems is strongly in uenced by the organization of the inverted index. This paper compares the performance impact on query processing of various physical organizations for inverted lists. We present a new probabilistic model of the database and queries. Simulation experiments determine those variables that most strongly in uence response time and throughput. This leads to a set of design trade-o s over a wide range of hardware con gurations and new parallel query processing strategies. Key Words. Performance, le organization, query processing, inverted le, inverted index, striping, shared-nothing, full text information retrieval. 1

Citations