Parallel search using partitioned inverted files

Examines the searching of partitioned inverted files with particular emphasis on issues that arise from different types of partitioning methods. Two types of index partitions are investigated, namely term identifier (TermId) partitioning and document identifier (DocId) partitioning. We describe the search operations implemented in order to support parallelism in probabilistic searching. We also describe higher-level features, such as search topologies, in parallel search methods. The results from runs on the two types of partitioning are compared and contrasted. We conclude that, within our framework, the DocId method is the best.