Efficient two-sided error-tolerant search

Authors:
Hannah Bast;Marjan Celikik
Affiliations:
University of Freiburg, Germany;University of Freiburg, Germany
Venue:
Proceedings of the 2nd International Workshop on Keyword Search on Structured Data
Year:
2010

Citing 3
Cited 1

Type less, find more: fast autocompletion search with a succinct index

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient interactive fuzzy keyword search

Proceedings of the 18th international conference on World wide web
Fast error-tolerant search on very large texts

Proceedings of the 2009 ACM symposium on Applied Computing

Fast construction of the HYB index

ACM Transactions on Information Systems (TOIS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document side (type algorithm, find documents with alogrithm). We show how to realize this feature with an index blow-up of 10% to 20% and an increase in query time by a factor of at most 2. We have integrated our two-sided error-tolerant search into a fully-functional search engine, and we provide experiments on three data sets of different kinds and sizes.