Optimization for dynamic inverted index maintenance

  • Authors:
  • D. Cutting;J. Pedersen

  • Affiliations:
  • Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California;Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California

  • Venue:
  • SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an effective tool in implementing such indices. The Zipfian distribution of postings suggests space and time optimizations unique to this task. In particular, we present two novel optimizations, merge update, which performs better than straight forward block update, and pulsing which significantly reduces space requirements without sacrificing performance.