一种基于路网D树的无线广播环境下路网最近邻查询处理算法

A network D-tree based method for nearest neighbor query processing in road networks under wireless broadcast environments

位置相关查询是数据库领域的一个研究热点。重点研究了无线广播环境下路网最近邻查询(NN)处理问题。对一个给定的路网结构及路网上分布的数据对象,构造对应的路网Voronoi图(NVD),并在NVD图的基础上构建路网D树索引结构。然后,将路网D树索引结构线性化以支持无线广播环境下路网NN查询的处理,并提出了相应的路网NN查询处理算法。模拟实验表明,所提出的算法是有效的。

Location-based queries （LBQs） have become a hot research topic in the database domain. This paper discusses the issue of processing nearest neighbor （NN） queries in road networks under wireless broadcast environments. For a certain road network together with its data objects, the corresponding Network Voronoi Diagram （NVD） is constructed. And then the D-tree index which is based on the NVD diagram is also constructed. Next, the D-tree index is linearized to support the NN query processing, and the corresponding NN query processing method is proposed. Experimental results prove the efficiency of our method.