Nearest neighbor queries in road networks
Nearest neighbor queries in road networks
复制标题
DOI：
10.1145/956676.956677
复制
发表时间：
2003-11
期刊：
影响因子：
--
通讯作者：
Christian S. Jensen;Jan Kolárvr;T. Pedersen;Igor Timko
中科院分区：
文献类型：
--
作者：
Christian S. Jensen;Jan Kolárvr;T. Pedersen;Igor Timko
随着无线通信和地理位置的广泛可用，可以提供新的电子服务，从而为移动用户提供有关其他移动对象的信息。本文涉及主动的，有序的K-Neart最邻居查询，以查询在道路网络中移动的查询和数据对象。此类查询可能在许多服务中都可以使用。特别是，我们提出了一个易于实现的数据模型，该模型为此类查询提供了很好的基础。我们还介绍了一个原型系统的设计，该系统基于数据模型实现查询。详细介绍了用于原型中最近邻居搜索的算法。此外，该论文报告了原型系统实验的结果。
With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries for query and data objects that are moving in road networks. Such queries may be of use in many services.Specifically, we present an easily implementable data model that serves well as a foundation for such queries. We also present the design of a prototype system that implements the queries based on the data model. The algorithm used for the nearest neighbor search in the prototype is presented in detail. In addition, the paper reports on results from experiments with the prototype system.