路网上范围受限的Top-k空间关键字查询  

Range-constrained Top-k Keyword Query on Road Networks

作　　者：陈子军[1,2] 李盛阳 刘文远 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]河北省计算机虚拟技术与系统集成重点实验室,河北秦皇岛066004

出　　处：《小型微型计算机系统》2017年第12期2707-2713,共7页Journal of Chinese Computer Systems

摘　　要：空间关键字查询是现在数据库领域的研究热点,查询时同时考虑对象与查询点的位置相关性和文本相关性.本文提出了路网上范围受限的Top-k空间关键字查询,查询返回在约束范围R内,满足关键字要求,并且距离查询点最近的前k个对象.尽管范围受限的近邻查询在欧式空间已经被研究过,但在路网中并没有关于这方面的研究.基于此,本文提出一种有效的算法.首先,为路网中的顶点建立标签索引,然后,为对象建立网格索引,查询时利用网格索引锁定查找范围,利用标签索引计算查询点与对象间的距离.最后,通过实验验证了该算法的有效性.Spatial keyword query （ SK query ） is now a hot research topic in database community, which considers both spatial proximity to the query location and textual relevance to the query keywords. In this paper,we propose a range constrained top-k keyword query on road network. Query returns k objects which satisfy the requirement of the keywords, and are nearest to the query point within the bound range R. Although the range constrained nearest neighbor query in Euclidean space has been studied, little is done to deal with it on road networks. Based on this, an efficient algorithm is proposed in this paper. First, we construct label index for vertices in the road network,then we build grid index for objects. When the query is executed,we can lock the search range by grid index and use label index to calculate the distance from query point to objects. Finally, extensive experiments demonstrate the efficiency of our presented algorithms.

关 键 词：空间关键字查询 范围约束 路网 标签 网格 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]