Fast on-line index construction by geometric partitioning

@inproceedings{Lester2005FastOI,
  title={Fast on-line index construction by geometric partitioning},
  author={N. Lester and A. Moffat and J. Zobel},
  booktitle={CIKM '05},
  year={2005}
}
  • N. Lester, A. Moffat, J. Zobel
  • Published in CIKM '05 2005
  • Computer Science
  • Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line merge-based methods, and provide efficient support for a variety of querying modes. In this paper we examine the task of on-line index construction -- that is, how to build an inverted index when the underlying data must be continuously queryable, and the documents must be indexed and available for search as soon they are inserted. When straightforward approaches are used… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Efficient online index construction for text databases
    • 55
    • Open Access
    Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree
    • 25
    • Highly Influenced
    On-line index maintenance using horizontal partitioning
    • 15
    • Highly Influenced
    • Open Access
    Efficient index updates for mixed update and query loads
    Low-cost management of inverted files for online full-text search
    • 21
    • Open Access
    Scalable online index construction with multi-core CPUs
    • 4
    • Open Access
    Hybrid index maintenance for growing text collections
    • 53
    • Highly Influenced
    • Open Access
    Hybrid index maintenance for contiguous inverted lists
    • 17
    • Highly Influenced
    • Open Access