Aggregate nearest neighbor queries in road networks
Aggregate nearest neighbor queries in road networks
复制标题
DOI：
10.1109/tkde.2005.87
复制
发表时间：
2005-06
影响因子：
8.9
通讯作者：
Man Lung Yiu;N. Mamoulis;Dimitris Papadias
中科院分区：
文献类型：
--
作者：
Man Lung Yiu;N. Mamoulis;Dimitris Papadias
聚合最近的邻居查询返回对象，该对象相对于一组查询点，将聚合距离函数最小化。例如，考虑想要找到餐厅（数据点）的特定位置（查询点）的几个用户，这导致了他们必须旅行才能满足的最小距离总和。我们研究了此类查询的处理，以使空间对象的位置和可访问性受到空间（例如道路）网络约束的情况。我们考虑利用欧几里得距离边界，空间访问方法和/或网络距离物质化结构的替代骨料功能和技术。我们的算法通过合成和真实数据对实验进行了评估。结果表明他们的相对性能取决于问题特征。
Aggregate nearest neighbor queries return the object that minimizes an aggregate distance function with respect to a set of query points. Consider, for example, several users at specific locations (query points) that want to find the restaurant (data point), which leads to the minimum sum of distances that they have to travel in order to meet. We study the processing of such queries for the case where the position and accessibility of spatial objects are constrained by spatial (e.g., road) networks. We consider alternative aggregate functions and techniques that utilize Euclidean distance bounds, spatial access methods, and/or network distance materialization structures. Our algorithms are experimentally evaluated with synthetic and real data. The results show that their relative performance depends on the problem characteristics.