路网中空间关键字连续范围查询算法研究  

Research on Processing Continuous Spatial Keyword Range Queries in Road Networks

作　　者：李艳红[1] 黄群[2] 蒋宏[3] 李国徽[4] 

机构地区：[1]中南民族大学计算机科学学院,武汉430074 [2]武汉数字工程研究所,武汉430074 [3]海军工程大学,武汉430033 [4]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《计算机科学》2014年第7期232-235,共4页Computer Science

基　　金：国家自然科学基金项目(61309002)资助

摘　　要：空间关键字查询相对传统的位置相关查询而言更能满足实际查询处理的需要。着重探讨路网中结合距离和关键字相似度两个因素的空间关键字查询处理问题,提出解决路网中空间关键字连续范围查询(CRSKQ)的有效方法。提出了一个综合考虑了路网上的道路、对象和路网的连通性的路网模型以支持CRSKQ查询的处理。为了实现连续监控,所提出的算法包括两个阶段,即初始结果获取和查询结果连续监控。初始结果监控阶段,通过路网扩展和关键字匹配寻找满足要求的结果对象;在连续监控阶段,充分利用前面时刻的查询结果来减小连续监控的代价。模拟实验表明,所提出的算法是有效的。Compared with traditional location-based queries, spatial keyword queries can better meet the requirement of actual query processing. The paper addressed the issue of processing spatial keyword queries which consider both the distance and the keyword similarity of objects, and presented an efficient method to deal with continuous spatial key- word range queries in road networks（CRSKQ）. A network model which considers the road segments, the objects, and the connectivity of the road network was proposed to support CRSKQ query processing. In order to continuously moni- tor the query result, a method which includes two phases, the initial query result getting phase and the continuous moni- toring phase,was proposed. In the first phase, the initial query result objects can be found by road network expansion and keyword matching. In the second phase, the cost of continuous query monitoring can be greatly reduced by taking advantage of the query result of the orevious time. Finally, exoerimental result shows the efficiency of our method.

关 键 词：位置相关查询 空间关键字范围查询 路网 算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]