首页> 外文会议>IEEE International Conference on Mobile Data Management >Evaluation of Spatial Keyword Queries with Partial Result Support on Spatial Networks
【24h】

Evaluation of Spatial Keyword Queries with Partial Result Support on Spatial Networks

机译:空间网络中具有部分结果支持的空间关键字查询的评估

获取原文

摘要

Numerous geographic information system applications need to retrieve spatial objects which bear user specified keywords close to a given location. In this research, we present efficient approaches to answer spatial keyword queries on spatial networks. In particular, we formally introduce definitions of Spatial Keyword k Nearest Neighbor (SKkNN) and Spatial Keyword Range (SKR) queries. Then, we present a framework of a spatial keyword query evaluation system which is comprised of Keyword Constraint Filter (KCF), Keyword and Spatial Refinement (KSR), and the spatial keyword ranker. KCF employs an inverted index to calculate keyword relevancy of spatial objects, and KSR refines intermediate results by considering both spatial and keyword constraints with the spatial keyword ranker. In addition, we design novel algorithms for evaluating SKkNN and SKR queries. These algorithms employ the inverted index technique, shortest path search algorithms, and network Voronoi diagrams. Our extensive simulations show that the proposed SKkNN and SKR algorithms can answer spatial keyword queries effectively and efficiently.
机译:许多地理信息系统应用程序都需要检索空间对象,这些空间对象的用户指定关键字接近给定位置。在这项研究中,我们提出了有效的方法来回答空间网络上的空间关键字查询。特别是,我们正式介绍了空间关键字k最近邻居(SKkNN)和空间关键字范围(SKR)查询的定义。然后,我们提出了一个空间关键字查询评估系统的框架,该系统由关键字约束过滤器(KCF),关键字和空间优化(KSR)以及空间关键字排名组成。 KCF使用倒排索引来计算空间对象的关键字相关性,而KSR通过使用空间关键字排名器同时考虑空间和关键字约束来细化中间结果。此外,我们设计了新颖的算法来评估SKkNN和SKR查询。这些算法采用倒排索引技术,最短路径搜索算法和网络Voronoi图。我们广泛的仿真结果表明,所提出的SKkNN和SKR算法可以有效且高效地回答空间关键字查询。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号