This paper presents an evaluation of three partitioning methods for distributed inverted
indexes: local, global and hybrid indexing, combined with two generalized query models …

In a shared-nothing, distributed text retrieval system, queries are processed over an inverted
index that is partitioned among a number of index servers. In practice, the index is either …

One of the greatest challenges in information retrieval is to develop an intelligent system for
user and machine interaction that supports users in their quest for relevant information. The …

In this paper, we study query processing in a distributed text database. The novelty is a real
distributed architecture implementation that offers concurrent query service. The distributed …

With the proliferation of the world's" information highways" has renewed interest in efficient
document indexing techniques. This thesis considers the architecture of information retrieval …

Pipelined query processing over a term-wise distributed inverted index has superior
throughput at high query multiprogramming levels. However, due to long query latencies this …

In a shared-nothing, parallel text retrieval system, queries are processed over an inverted
index that is partitioned among a number of index servers. In practice, the inverted index is …

An indexing scheme called partitioned global indexes (PGI) for a locally distributed
database system is presented. The scheme builds a global index for the entire relation and …

Term-partitioning is an efficient way to distribute a large inverted index. Two fundamentally
different query processing approaches are pipelined and non-pipelined. While the pipelined …

The impact on query processing performance of various physical organizations for inverted
lists is compared. A probabilistic mode of the database and queries is introduced. Simulation …