Javascript must be enabled to continue!
A Survey of Query Auto Completion in Information Retrieval
View through CrossRef
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al., 2013, Cai et al., 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the following functionality: given a prefix consisting of a number of characters entered into a search box, the user interface proposes alternative ways of extending the prefix to a full query. Ranking query completions is a challenging task due to the limited length of prefixes entered by users, the large volume of possible query completions matching a prefix, and the broad range of possible search intents. In recent years, a large number of query auto completion approaches have been proposed that produce ranked lists of alternative query completions by mining query logs.
In this survey, we review work on query auto completion that has been published before 2016. We focus mainly on web search and provide a formal definition of the query auto completion problem. We describe two dominant families of approaches to the query auto completion problem, one based on heuristic models and the other based on learning to rank. We also identify dominant trends in published work on query auto completion, viz. the use of time-sensitive signals and the use of user-specific signals. We describe the datasets and metrics that are used to evaluate algorithms for query auto completion. We also devote a chapter to efficiency and a chapter to presentation and interaction aspects of query auto completion. We end by discussing related tasks as well as potential research directions to further the area.
Title: A Survey of Query Auto Completion in Information Retrieval
Description:
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al.
, 2013, Cai et al.
, 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the following functionality: given a prefix consisting of a number of characters entered into a search box, the user interface proposes alternative ways of extending the prefix to a full query.
Ranking query completions is a challenging task due to the limited length of prefixes entered by users, the large volume of possible query completions matching a prefix, and the broad range of possible search intents.
In recent years, a large number of query auto completion approaches have been proposed that produce ranked lists of alternative query completions by mining query logs.
In this survey, we review work on query auto completion that has been published before 2016.
We focus mainly on web search and provide a formal definition of the query auto completion problem.
We describe two dominant families of approaches to the query auto completion problem, one based on heuristic models and the other based on learning to rank.
We also identify dominant trends in published work on query auto completion, viz.
the use of time-sensitive signals and the use of user-specific signals.
We describe the datasets and metrics that are used to evaluate algorithms for query auto completion.
We also devote a chapter to efficiency and a chapter to presentation and interaction aspects of query auto completion.
We end by discussing related tasks as well as potential research directions to further the area.
Related Results
Query expansion by relying on the structure of knowledge bases
Query expansion by relying on the structure of knowledge bases
Query expansion techniques aim at improving the results achieved by a user's query by means of introducing new expansion terms, called expansion features. Expansion features introd...
Query Optimization in Uncertain and Probabilistic Databases
Query Optimization in Uncertain and Probabilistic Databases
Abstract
Query optimization is a critical aspect of database systems as it helps to reduce query execution time and improve system performance. In this study, Probabilistic...
QUERY RESPONSE TIME COMPARISON NOSQLDB MONGODB WITH SQLDB ORACLE
QUERY RESPONSE TIME COMPARISON NOSQLDB MONGODB WITH SQLDB ORACLE
Penyimpanan data saat ini terdapat dua jenis yakni relational database dan non-relational database. Kedua jenis DBMS (Database Managemnet System) tersebut berbeda dalam berbagai ...
Perbandingan Optimasi Query Menggunakan Query Scalar, Correlated Dan Kombinasi
Perbandingan Optimasi Query Menggunakan Query Scalar, Correlated Dan Kombinasi
Optimasi query merupakan suatu pola penulisan SQL yang mengacu pada standar SQL. Optimasi query ini sangat penting untuk dapat dipelajari karena dengan optimasi query ini kita dapa...
Modified Firefly Algorithm for Optimizing Biomedical Breast Cancer Queries
Modified Firefly Algorithm for Optimizing Biomedical Breast Cancer Queries
Abstract
Querying and retrieving Semantic Web data is a challenging task due to the increment in its volume. Many query languages were designed to retrieve Semantic Web dat...
DARE-RAG: Difficulty-Aware Retrieval Expansion for Retrieval-Augmented Generation
DARE-RAG: Difficulty-Aware Retrieval Expansion for Retrieval-Augmented Generation
Retrieval-Augmented Generation (RAG) systems face a fundamental trade-off: query expansion can improve retrieval effectiveness for ambiguous or underspecified queries, yet indiscri...
Unconventional Method of Subsea Umbilical Retrieval Using Anchor Handling Vessel
Unconventional Method of Subsea Umbilical Retrieval Using Anchor Handling Vessel
Abstract
A deepwater field in West Africa was decommissioned and subsea facilities retrieval operation was carried out as part of the Abandonment and Decommissioning...
VISA-Agent: A Visual Symbolic Agent for Reasoning-Intensive Multimodal Retrieval
VISA-Agent: A Visual Symbolic Agent for Reasoning-Intensive Multimodal Retrieval
Reasoning-intensive multimodal retrieval suffers from a counter-intuitive bottleneck: on MM-BRIGHT multimodal-to-text (Query+Image → Documents), the strongest dense multimodal enco...

