.png){kind=icon}
返回
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2019.2894140.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A significant proportion of all search volume consists of local searches. As a result, search engines must be capable of finding relevant results combining both spatial proximity and textual relevance with high query throughput. We observe that existing techniques answering these spatial keyword queries use keyword aggregated indexing, which has several disadvantages on road networks. We propose K-SPIN, a versatile framework that instead uses keyword separated indexing to delay and avoid expensive operations. At first glance, this strategy appears to have impractical pre-processing costs. However, by exploiting several useful observations, we make the indexing cost not only viable but also light-weight. For example, we propose a novel $\rho$rho-Approximate Network Voronoi Diagram (NVD) with one order of magnitude less space cost than exact NVDs. By carefully exploiting features of the K-SPIN framework, our query algorithms are up to two orders of magnitude more efficient than the state-of-the-art as shown in our experimental investigation on various queries, parameter settings, and real road network and keyword datasets.
Keyword:
Roads
Indexing
Throughput
Delays
Search engines
Approximation algorithms
Road networks
points of interest search
spatio-textual queries
network Voronoi diagrams
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Redox-dependent structure change and hyperfine nuclear magnetic resonance shifts in cytochrome c.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏G-Tree: An Efficient and Scalable Index for Spatial Search on Road NetworksG树: 一种有效的可扩展的道路网络空间搜索索引
PREAI
分享收藏
查看更多内容