Distributed query processing using partitioned inverted files

In this paper; we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that oflers concurrent query service. The distributed system adopts a network of workstations model and the client-server paradigm. The document collection is indexed with an imerted$le. We adopt two distinct strategies of index partitioning in the distributed system, namely local index partitioning and global indexpartitioning. In both strategies, documents are ranked using the vector space model along with a documentfiltering technique for fast ranking. We evaluate and compare the impact of the two index partitioning strategies on query processing per$ormance. Experimental results on retrieval eficiency show that, within our framework, the global index partitioning outpe~orms the local index partitioning.