Locality-Based pruning methods for web search

  • Authors:

  • Edleno Silva de Moura;Celia Francisca dos Santos;Bruno Dos santos de Araujo;Altigran Soares da Silva;Pavel Calado;Mario A. Nascimento

  • Affiliations:

  • Federal University of Amazonas, Brazil;Federal University of Amazonas, Brazil;Federal University of Amazonas, Brazil;Federal University of Amazonas, Brazil;IST/Inesc-ID, Porto Salvo, Portugal;University of Alberta, Edmonton AB, Canada

  • Venue:
  • ACM Transactions on Information Systems (TOIS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article discusses a novel approach developed for static index pruning that takes into account the locality of occurrences of words in the text. We use this new approach to propose and experiment on simple and effective pruning methods that allow a fast construction of the pruned index. The methods proposed here are especially useful for pruning in environments where the document database changes continuously, such as large-scale web search engines. Extensive experiments are presented showing that the proposed methods can achieve high compression rates while maintaining the quality of results for the most common query types present in modern search engines, namely, conjunctive and phrase queries. In the experiments, our locality-based pruning approach allowed reducing search engine indices to 30% of their original size, with almost no reduction in precision at the top answers. Furthermore, we conclude that even an extremely simple locality-based pruning method can be competitive when compared to complex methods that do not rely on locality information.