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.
Original language | English |
---|---|
Pages | 819-820 |
Number of pages | 2 |
DOIs | |
Publication status | Published - 3 Apr 2017 |
Fields of Science
- 113 Computer and information sciences