Location-sensitive Query Auto-completion

Chunbin Lin, Jianguo Wang, Jiaheng Lu

Forskningsoutput: KonferensbidragPosterForskningPeer review

Sammanfattning

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.
Originalspråkengelska
Sidor819-820
Antal sidor2
DOI
StatusPublicerad - 3 apr 2017

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här

Lin, Chunbin ; Wang, Jianguo ; Lu, Jiaheng. / Location-sensitive Query Auto-completion. 2 s.
@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",
note = "Volume: Proceeding volume:",
year = "2017",
month = "4",
day = "3",
doi = "10.1145/3041021.3054205",
language = "English",
pages = "819--820",

}

Location-sensitive Query Auto-completion. / Lin, Chunbin; Wang, Jianguo; Lu, Jiaheng.

2017. 819-820.

Forskningsoutput: KonferensbidragPosterForskningPeer review

TY - CONF

T1 - Location-sensitive Query Auto-completion

AU - Lin, Chunbin

AU - Wang, Jianguo

AU - Lu, Jiaheng

N1 - Volume: Proceeding volume:

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

U2 - 10.1145/3041021.3054205

DO - 10.1145/3041021.3054205

M3 - Poster

SP - 819

EP - 820

ER -