无线数据广播环境下k近邻查询研究

Nearest neighbor query in wireless broadcast environments

近邻查询问题是基于位置的查询的重要问题之一,是要找到距离查询点最近的k个对象的集合。无线数据广播技术能够有效地避免C/S模式在处理海量数据时的弊端,也能够对用户的位置信息进行隐私保护。将无线数据广播技术应用到k近邻查询中,利用Hilbert曲线组织空间结构,结合无线数据广播技术具有线性的特性,通过过滤和剪枝两个步骤,最终找到查询点的k个最近邻集合。

Nearest neighbor query is one of LBS query, which is to find the k objects set nearest to the query point. Wireless broadcast technology can effectively avoid the disadvantages of C/S mode dealing with massive data, but also protect the information about the user's location. The wireless data broadcast technology is applied to the k nearest neighbor query,using the Hilbert curve to organize the spatial structure, combining the characteristics of wireless data broadcast technology,finally finding the k nearest neighbor set of query point has,through filtering and pruning .