Location-sensitive Query Auto-completion

Chunbin Lin; Jianguo Wang; Jiaheng Lu

doi:10.1145/3041021.3054205

Location-sensitive Query Auto-completion

Chunbin Lin, Jianguo Wang, Jiaheng Lu

Tutkimustuotos: Konferenssimateriaalit › Posteri › vertaisarvioitu

Abstrakti

This paper studies the location-sensitive auto-completion problem. We propose an efficient algorithm SQA running on a native index combining both IR-tree and Trie index. The experiments on real-life datasets demonstrate that SQA outperforms baseline methods by one order of magnitude.

Alkuperäiskieli	englanti
Sivut	819-820
Sivumäärä	2
DOI - pysyväislinkit	https://doi.org/10.1145/3041021.3054205
Tila	Julkaistu - 3 huhtik. 2017

Tieteenalat

113 Tietojenkäsittely- ja informaatiotieteet

Pääsy asiakirjaan

10.1145/3041021.3054205Lisenssi: CC BY

p819-lin(1)Lopullinen julkaistu versio, 488 KBLisenssi: CC BY

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@conference{221b521796b24da7bcc9c87295d13b8a,

title = "Location-sensitive Query Auto-completion",

abstract = "This paper studies the location-sensitive auto-completion problem. We propose an efficient algorithm SQA running on a native index combining both IR-tree and Trie index. The experiments on real-life datasets demonstrate that SQA outperforms baseline methods by one order of magnitude.",

keywords = "113 Computer and information sciences",

author = "Chunbin Lin and Jianguo Wang and Jiaheng Lu",

year = "2017",

month = apr,

day = "3",

doi = "10.1145/3041021.3054205",

language = "English",

pages = "819--820",

}

TY - CONF

T1 - Location-sensitive Query Auto-completion

AU - Lin, Chunbin

AU - Wang, Jianguo

AU - Lu, Jiaheng

PY - 2017/4/3

Y1 - 2017/4/3

N2 - This paper studies the location-sensitive auto-completion problem. We propose an efficient algorithm SQA running on a native index combining both IR-tree and Trie index. The experiments on real-life datasets demonstrate that SQA outperforms baseline methods by one order of magnitude.

AB - This paper studies the location-sensitive auto-completion problem. We propose an efficient algorithm SQA running on a native index combining both IR-tree and Trie index. The experiments on real-life datasets demonstrate that SQA outperforms baseline methods by one order of magnitude.

KW - 113 Computer and information sciences

UR - https://www.scopus.com/pages/publications/85055315305

U2 - 10.1145/3041021.3054205

DO - 10.1145/3041021.3054205

M3 - Poster

SP - 819

EP - 820

ER -