Abstract
Traditional information systems usually return few answers if a user submits an incomplete query. Users often feel “left in the dark” when they have limited knowledge about the underlying data. They have to use a try-and-see approach to modify queries and find answers. In this paper we propose a novel approach to keyword search which can provide predicted keywords when a user submits a few characters of the underlying data in order. We study research challenges in this framework for large amounts of data. Since each keystroke of the user could invoke a query on the backend, we need efficient algorithms to process each query within milliseconds. We develop an incremental-search algorithm using previously computed and cached results in order to achieve an interactive speed. Some experiments have been conducted to prove the practicality of this new computing paradigm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ji, S., Li, G., Li, C., Feng, J.: Efficient interactive fuzzy keyword search. In: WWW, pp. 371–380 (2009)
Grabski, K., Scheffer, T.: Sentence completion. In: SIGIR, pp. 433–439 (2004)
Kukich, K., Li, C.: Selectivity estimation for fuzzy string predicates in large data sets. In: VLDB, pp. 793–804 (2005)
Motoda, H., Yoshida, K.: Machine learning techniques to make computers easier to use. Artif. Intell. 103(1-2), 295–321 (1998)
Nandi, A., Jagadish, H.V.: Effective phrase prediction. In: VLDB, pp. 219–230 (2007)
Williams, H.E., Zobel, J., Bahle, D.: Fast phrase querying with combined indexes. ACM Trans. Inf. Syst. 22(4), 573–594 (2004)
Bast, H., Weber, I.: Type less, find more: fast autocompletion search with a succinct index. In: SIGIR, pp. 364–371 (2006)
Bast, H., Weber, I.: The completesearch engine: Interactive, efficient, and towards ir & db integration. In: CIDR, pp. 88–95 (2007)
Bast, H., Chitea, A., Suchanek, F.M., Weber, I.: Ester: efficient search on text, entities, and relation. In: SIGIR, pp. 671–678 (2007)
Bast, H., Mortensen, C.W., Weber, I.: Output-sensitive autocompletion search. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 150–162. Springer, Heidelberg (2006)
Vernica, R., Li, C.: Efficient top-k algorithms for fuzzy search in string collection. In: KEYS, pp. 9–14 (2009)
Chaudhuri, S., Kaushik, R.: Extending autocompletion to tolerate errors. In: SIGMOD, pp. 707–718 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, S., Yu, W., Gu, X., Jiang, H., Fang, C. (2010). Efficient Interactive Smart Keyword Search. In: Chen, L., Triantafillou, P., Suel, T. (eds) Web Information Systems Engineering – WISE 2010. WISE 2010. Lecture Notes in Computer Science, vol 6488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17616-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-17616-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17615-9
Online ISBN: 978-3-642-17616-6
eBook Packages: Computer ScienceComputer Science (R0)