路网移动对象空间关键字连续Top-k查询  

Continuous top-kspatial keyword queries over moving objects in road networks

作　　者：李艳红[1] 李国徽[2] 周斌[1] 

机构地区：[1]中南民族大学计算机科学学院,湖北武汉430074 [2]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2014年第6期127-132,共6页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61309002);湖北省自然科学基金资助项目(2012FFB07401)

摘　　要：为了克服现有空间关键字查询方法大多只适用于欧氏空间查询处理的局限性,提出了一种渐增监控查询处理方法(CMA),以高效处理路网中移动对象空间关键字连续top-k查询问题(CMkSK).该方法用一棵组合扩展树CEtree来界定查询的监控范围,通过识别、处理监控范围内对查询结果有影响的查询点和移动对象的位置更新对相应的CEtree进行修正,以保证查询结果的持续有效性.所提出的方法考虑了现实生活中对象的可移动性,可以处理查询点和数据对象在路网中自由移动的情形.最后,通过模拟实验证明了所提出算法较参照算法的性能提高约1.1倍.In order to overcome the problem that most of the existing spatial keyword query（SKQ） methods are limited in Euclidean space,a novel method called CMA（continuously monitoring algorithm）was presented to efficiently process continuous top-k SKQ queries over moving objects（CMkSK）in road networks.A data structure called combined expansion tree（CEtree）was proposed to represent the whole monitoring region of a CMkSK query,and all related object position updates and query position updates were identified and processed to amend the CEtree,so as to give the correct query result continuously.The proposed method was taken into consideration the mobility of objects in real life,and could deal with the situation where the query point and data objects could freely move within the road network.Finally,experimental result shows that the proposed method is about 1.1times more efficient than its competitor.

关 键 词：空间关键字查询 TOP-K查询 移动对象 路网 算法 

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