Output-Sensitive Autocompletion Search

  • Holger Bast
  • Christian W. Mortensen
  • Ingmar Weber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4209)

Abstract

We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query word that would lead to the best hits, and also display the best such hits. The following problem is at the core of this feature: for a fixed document collection, given a set D of documents, and an alphabetical range W of words, compute the set of all word-in-document pairs (w,d) from the collection such that wW and dD. We present a new data structure with the help of which such autocompletion queries can be processed, on the average, in time linear in the input plus output size, independent of the size of the underlying document collection. At the same time, our data structure uses no more space than an inverted index. Actual query processing times on a large test collection correlate almost perfectly with our theoretical bound.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Holger Bast
    • 1
  • Christian W. Mortensen
    • 2
  • Ingmar Weber
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.IT University of CopenhagenDenmark

Personalised recommendations