首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Authentication of k Nearest Neighbor Query on Road Networks
【24h】

Authentication of k Nearest Neighbor Query on Road Networks

机译:路网第k个最近邻居查询的认证

获取原文
获取原文并翻译 | 示例

摘要

Outsourcing spatial databases to the cloud provides an economical and flexible way for data owners to deliver spatial data to users of location-based services. However, in the database outsourcing paradigm, the third-party service provider is not always trustworthy, therefore, ensuring spatial query integrity is critical. In this paper, we propose an efficient road network (k) -nearest-neighbor query verification technique which utilizes the network Voronoi diagram and neighbors to prove the integrity of query results. Unlike previous work that verifies (k) -nearest-neighbor results in the Euclidean space, our approach needs to verify both the distances and the shortest paths from the query point to its (k) NN results on the road network. We evaluate our approach on real-world road networks together with both real and synthetic points of interest datasets. Our experiments run on Google Android mobile devices which communicate with the service provider through wireless connections. The experiment results show that our approach leads to compact verification objects ( (mathcal {VO}) ) and the verification algorithm on mobile devices is efficient, especially for queries with low selectivity.
机译:将空间数据库外包到云端为数据所有者提供了一种经济而灵活的方式,可以将空间数据交付给基于位置的服务的用户。但是,在数据库外包模式中,第三方服务提供者并不总是可信赖的,因此,确保空间查询的完整性至关重要。本文提出了一种有效的道路网络(k)-最近邻查询验证技术,该技术利用网络Voronoi图和邻居来证明查询结果的完整性。与先前的工作验证欧几里得空间中的(k)个最近邻居结果不同,我们的方法需要验证距离和从查询点到道路网络上(k)个NN结果的最短路径。我们评估我们在现实世界道路网络上的方法,以及真实和综合兴趣点数据集。我们的实验在Google Android移动设备上运行,这些设备通过无线连接与服务提供商进行通信。实验结果表明,我们的方法导致了紧凑的验证对象((数学{VO})),并且在移动设备上的验证算法非常有效,尤其是对于选择性低的查询。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号