Efficient and Effective Query Auto-Completion

05/13/2020
by   Simon Gog, et al.
0

Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems, suggesting possible ways of completing the query being typed by the user. Efficiency is crucial to make the system have a real-time responsiveness when operating in the million-scale search space. Prior work has extensively advocated the use of a trie data structure for fast prefix-search operations in compact space. However, searching by prefix has little discovery power in that only completions that are prefixed by the query are returned. This may impact negatively the effectiveness of the QAC system, with a consequent monetary loss for real applications like Web Search Engines and eCommerce. In this work we describe the implementation that empowers a new QAC system at eBay, and discuss its efficiency/effectiveness in relation to other approaches at the state-of-the-art. The solution is based on the combination of an inverted index with succinct data structures, a much less explored direction in the literature. This system is replacing the previous implementation based on Apache SOLR that was not always able to meet the required service-level-agreement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2017

Query Completion Using Bandits for Engines Aggregation

Assisting users by suggesting completed queries as they type is a common...
research
04/17/2018

Personalized neural language models for real-world query auto completion

Query auto completion (QAC) systems are a standard part of search engine...
research
06/06/2020

Utilising Information Foraging Theory for User Interaction with Image Query Auto-Completion

Query Auto-completion (QAC) is a prominently used feature in search engi...
research
12/09/2019

Query Auto Completion for Math Formula Search

Query Auto Completion (QAC) is among the most appealing features of a we...
research
12/09/2020

Session-Aware Query Auto-completion using Extreme Multi-label Ranking

Query auto-completion is a fundamental feature in search engines where t...
research
03/20/2021

PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration

We study the hop-constrained s-t path enumeration (HcPE) problem, which ...
research
07/01/2019

On Slicing Sorted Integer Sequences

Representing sorted integer sequences in small space is a central proble...

Please sign up or login with your details

Forgot password? Click here to reset