Parallel information retrieval with query expansion

Abstract

An information retrieval (IR) system withquery expansion on a low-cost high-performance PC cluster environment is implemented. The IR system stores document sets, it is indexed by the invertedindex- file (IIF), and the vector space model is used as ranking strategy. The query expansion is adding terms into the original query for raising retrieval effectiveness. In this work, the query expansion with the collocation-based similarity measure is used. In our parallel IR system, the inverted-index file (IIF) is partitioned into pieces using the lexical and the greedy declustering methods. For each incoming user's query withm ultiple terms after query expansion, terms are sent to the corresponding nodes that contain the relevant pieces of the IIF to be evaluated in parallel. We study how query performance is affected by query expansion and two declustering methods using two standard Korean test collections. According to the experiments, the greedy method shows about 20% enhancement overall when compared with the lexical method.