一种新的道路网络连续查询处理方法

Novel Method for Continuous Queries Processing in Road Networks

基于道路网络的连续k近邻查询是移动对象数据库领域的研究重点和热点。提出了一种新的道路网络有向图模型,通过引入有向网络空间度量,利用基于内存的格网索引和线性链表结构来对移动对象当前位置和道路网络有向图模型进行存储和管理;基于有向距离度量提出了单向网络扩展(DNE)算法,以减少连续k近邻查询的网络扩展搜索代价。实验结果表明,DNE算法性能优于现有的连续k近邻查询处理算法。

CKNN （Continuous k-Nearest Neighbor） queries in road networks have recently received many attentions in moving objects databases. In this paper, we presented a novel road networks directional graph model and use memoryresident grid cell structure and linear list structures to store the moving objects and road network directional model. By introducing directional network distance measurement we proposed the directional network expansion （DNE） algorithm to reduce the network searching cost of CKNN queries processing. Experimental results show that the DNE algorithm outperforms existing algorithms.