Aggregate nearest neighbors query based on influence zone in road networks
To solve the problem of aggregate nearest neighbors (ANN) query in spatial database, we propose an effective solution based on the influence zone. Aggregate nearest neighbor queries return the target object that minimizes an aggregate distance function with respect to a set of query points. In this paper, an influence zone is constructed with a convex hull of the set of query points. The target object is certainly not the query result if it does not lie in the influence zone. The algorithm greatly reduces the search range and the calculation of the distance compared to the existing algorithms. Our works not only prove the feasibility and correctness of the algorithm by the theoretical analysis, and verify the effectiveness and stability of the algorithm by experiment. The experimental results show that the proposed algorithm can more efficiently to complete aggregate nearest neighbor query in road network. © 2014 Binary Information Press.
Journal of Computational Information Systems
Zhang, X., Xu, J., Xu, M., Zheng, N., & Feng, S. (2014). Aggregate nearest neighbors query based on influence zone in road networks. Journal of Computational Information Systems, 10 (9), 3905-3912. https://doi.org/10.12733/jcis10366