Advancing search query autocompletion services with more and better suggestions

Authors:
Dimitrios Kastrinakis;Yannis Tzitzikas
Affiliations:
Computer Science Department, University of Crete, Greece;Institute of Computer Science, FORTH-ICS, Greece
Venue:
ICWE'10 Proceedings of the 10th international conference on Web engineering
Year:
2010

Citing 7
Cited 3

Trie partitioning process: limiting distributions

CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees

Journal of Intelligent Information Systems
Bulk Operations for Space-Partitioning Trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Boosting the performance of Web search engines: Caching and prefetching query results by exploiting historical usage data

ACM Transactions on Information Systems (TOIS)
Performance of compressed inverted list caching in search engines

Proceedings of the 17th international conference on World Wide Web
MatchUp: Autocompletion for Mashups

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Semantic autocompletion

ASWC'06 Proceedings of the First Asian conference on The Semantic Web

Exploiting available memory and disk for scalable instant overview search

WISE'11 Proceedings of the 12th international conference on Web information system engineering
Scalable, flexible and generic instant overview search

Proceedings of the 21st international conference companion on World Wide Web
Recent and robust query auto-completion

Proceedings of the 23rd international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

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.