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åk | engelska |
---|---|
Sidor | 819-820 |
Antal sidor | 2 |
DOI | |
Status | Publicerad - 3 apr. 2017 |
Vetenskapsgrenar
- 113 Data- och informationsvetenskap