TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks
Chengyang Luo, Qing Liu, Yunjun Gao, Lu Chen, Ziheng Wei, Congcong Ge
Abstract
Instant spatial keyword queries return the results as soon as users type in some characters instead of a complete keyword, which allow users to query the geo-textual data in a type-as-you-search manner. However, the existing methods of instant spatial keyword queries suffer from several limitations. For example, the existing methods do not consider the typographical errors of input keywords, and cannot be applied to the road networks. To overcome these limitations, in this paper, we propose a new query type, i.e., instant error-tolerant spatial keyword queries on road networks. To answer the queries efficiently, we present a framework, termed as Task, which consists of index component, query component, and update component. In the index component, we design a novel index called reverse 2-hop label based trie, which seamlessly integrates spatial and textual information for each vertex of the road network. Based on our proposed index, we devise efficient algorithms to progressively return and update the query results in the query component and update component, respectively. Finally, we conduct extensive experiments on real-world road networks to evaluate the performance of our presented Task. Empirical results show that our proposed index and algorithms are up to 1--2 orders of magnitude faster than the baseline.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c8559dd4-26ef-4180-94ec-926db8634681Cited by top-tier papers1
Ask how each one uses itBuilds on4
- Dynamic Hub Labeling for Road NetworksMengxuan Zhang, Lei Li, Wen Hua, Rui Mao et al.ICDE 2021 · 52 citations
- Efficient 2-Hop Labeling Maintenance in Dynamic Small-World NetworksMengxuan Zhang, Lei Li, Wen Hua, Xiaofang ZhouICDE 2021 · 49 citations
- An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic NetworkMengxuan Zhang, Lei Li, Xiaofang ZhouVLDB 2021 · 36 citations
- P2H: Efficient Distance Querying on Road Networks by Projected Vertex SeparatorsZitong Chen, Ada Wai-Chee Fu, Minhao Jiang, Eric Lo et al.SIGMOD 2021 · 32 citations
Related papers
- Double Hierarchical Labeling Shortest Distance Querying in Time-dependent Road NetworksTangpeng Dan, Xiao Pan, Bolong Zheng, Xiaofeng MengICDE 2023 · 7 citations
- Effectiveness Perspectives and a Deep Relevance Model for Spatial Keyword QueriesShang Liu, Gao Cong, Kaiyu Feng, Wanli Gu et al.SIGMOD 2023 · 10 citations
- Workload-Aware Shortest Path Distance Querying in Road NetworksBolong Zheng, Jingyi Wan, Yongyong Gao, Yong Ma et al.ICDE 2022 · 6 citations
- OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure EnclavesZikai Ye, Xiangyu Wang, Zesen Liu, Dan Zhu et al.SIGMOD 2025 · 8 citations
- FAHL: An Efficient Labeling Index for Flow-Aware Shortest Path Querying in Road NetworksTangpeng Dan, Xiao Pan, Bolong Zheng, Xiaofeng MengICDE 2025
