Sciweavers

Share
SIGMOD
2010
ACM

Efficient two-sided error-tolerant search

9 years 7 months ago
Efficient two-sided error-tolerant search
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. Categories and Subject Descriptors H.3.3 [Information Search and Retrieval]: Search process; H.3.4 [Systems and Software]: Performance evaluation (efficiency and effectiveness) General Terms Algorithms, Experimentation, Measurement, Performance Keywords Error-Tolerant Search, Fuzzy Search
Hannah Bast, Marjan Celikik
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where SIGMOD
Authors Hannah Bast, Marjan Celikik
Comments (0)
books