Advancing Search Query Autocompletion Services with More and Better Suggestions

  • Dimitrios Kastrinakis
  • Yannis Tzitzikas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6189)

Abstract

Autocompletion services help users in formulating queries by exploiting past queries. In this paper we propose methods for improving such services; specifically methods for increasing the number and the quality of the suggested “completions”. In particular, we propose a novel method for partitioning the internal data structure that keeps the suggestions, making autocompletion services more scalable and faster. In addition we introduce a ranking method which promotes a suggestion that can lead to many other suggestions. The experimental and empirical results are promising.

References

  1. 1.
    Abiteboul, S., Greenshpan, O., Milo, T., Polyzotis, N.: Matchup: Autocompletion for mashups. In: IEEE International Conference on Data Engineering, Shanghai, China, pp. 1479–1482 (2009)Google Scholar
  2. 2.
    Aref, W.G., Ilyas, I.F.: Sp-gist: An extensible database index for supporting space partitioning trees. Journal of Intelligent Information Systems 17(2-3) (December 2001)Google Scholar
  3. 3.
    Arias, M., Cantera, J.M., Vegas, J.: Context based personalization for mobile web search. In: VLDB ’08 (August 2008)Google Scholar
  4. 4.
    Baberwal, S., Choi, B.: Speeding up keyword search for search engines. In: 3rd IASTED International Conference on Communications, Internet, and Information Technology, St. Thomas, US Virgin Islands, pp. 255–260 (November 2004)Google Scholar
  5. 5.
    Bast, H., Weber, I.: When you ’re lost for words: Faceted search with autocompletion. In: SIGIR ’06 Workshop on Faceted Search, Seattle, Washington, USA (August 2006)Google Scholar
  6. 6.
    Bowman, D.E., Ortega, R.E., Hamrick, M.L., Spiegel, J.R., Kohn, T.R.: Refining search queries by the suggestion of correlated terms from prior searches. Patent Number: 6,006,225 (December 1999)Google Scholar
  7. 7.
    Draganova, C.: Asynchronous javascript technology and xml (ajax), http://www.myacrobatpdf.com/6319/asynchronous-javascript-technology-and-xml-ajax.html
  8. 8.
    Eltabakh, M.Y., Eltarras, R., Aref, W.G.: To trie or not to trie? realizing space-partitioning trees inside postgresql: Challenges, experiences and performance. In: Procs. of the 31st VLDB Conference, Trondheim, Norway (2005)Google Scholar
  9. 9.
    Fagni, T., Perego, R., Silvestri, F., Orlando, S.: Boosting the performance of web search engines Caching and prefetching query results by exploiting historical usage data. ACM Transactions on Information Systems (TOIS), 51–78 (2006)Google Scholar
  10. 10.
    Ghanem, T.M., Shah, R., Mokbel, M.F., Aref, W.G., Vitter, J.S.: Bulk operations for space-partitioning trees. In: 20th International Conference on Data Engineering (March 2004)Google Scholar
  11. 11.
    Hyvonen, E., Makela, E.: Semantic autocompletion. In: Mizoguchi, R., Shi, Z.-Z., Giunchiglia, F. (eds.) ASWC 2006. LNCS, vol. 4185, pp. 739–751. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Jacquet, P., Regnier, M.: Trie partitioning process: Limiting distributions, vol. 214. Springer, Heidelberg (1986)Google Scholar
  13. 13.
    Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proceedings of the 17th international conference on World Wide Web, Beijing, China (April 2008)Google Scholar
  14. 14.
    Mason, T., Lawrence, R.: Auto-completion of Underspecified SQL Queries. Springer, Heidelberg (2006)Google Scholar
  15. 15.
    Ortega, R.E., Avery, J.W., Frederick, R.: Search query autocompletion. Patent Number: US 6,564,213 B1 (May 2003)Google Scholar
  16. 16.
    Whitman, R.M., Scofield, C.L.: Search query refinement using related search phrases. Patent Number: US 6,772,150 B1 (August. 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dimitrios Kastrinakis
    • 1
  • Yannis Tzitzikas
    • 1
    • 2
  1. 1.Computer Science DepartmentUniversity of CreteGreece
  2. 2.Institute of Computer ScienceFORTH-ICSGreece

Personalised recommendations