首页> 外文期刊>Knowledge-Based Systems >Efficient reverse spatial and textual k nearest neighbor queries on road networks
【24h】

Efficient reverse spatial and textual k nearest neighbor queries on road networks

机译:道路网络上有效的反向空间和文本k最近邻查询

获取原文
获取原文并翻译 | 示例
           

摘要

The proliferation of geo-positioning technologies boosts the prevalence of GPS-enabled devices, and thus many spatial-textual objects that possess both text descriptions and geo-locations are extensively available in reality. Hence, how to efficiently exploit both spatial and textual description of objects to a spatial keyword query (SKQ) has increasingly become a challenging problem. Previous studies on SKQ problem usually focus on Euclidean space. In the real world, however, most of the spatial-textual objects lie on road networks. This paper takes the first step to investigate a novel problem, namely, reverse spatial and textual k nearest neighbor (RSTkNN) queries on road networks. We formalize the RSTkNN queries and present several spatial keyword pruning methods to accelerate the query processing. Then two effective verifying techniques are proposed, which can be seamlessly integrated into our RSTkNN query procedure. Finally, comprehensive experiments on real-world and synthetic data sets are conducted to demonstrate the performance of our approaches. (c) 2015 Elsevier B.V. All rights reserved.
机译:地理定位技术的发展促进了启用GPS的设备的普及,因此,许多同时具有文本描述和地理位置的空间文本对象在现实中可广泛获得。因此,如何有效地利用对象的空间描述和文本描述来进行空间关键词查询(SKQ)已成为一个具有挑战性的问题。先前对SKQ问题的研究通常集中在欧几里得空间上。但是,在现实世界中,大多数空间文本对象都位于道路网络上。本文迈出第一步来研究一个新的问题,即道路网络上的反向空间和文本k最近邻(RSTkNN)查询。我们对RSTkNN查询进行形式化,并提出几种空间关键字修剪方法以加速查询处理。然后提出了两种有效的验证技术,可以将它们无缝集成到我们的RSTkNN查询过程中。最后,在现实世界和综合数据集上进行了全面的实验,以证明我们方法的性能。 (c)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号