Skip to main content
SpringerLink
Log in

On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

An aggregate nearest neighbor (ANN) query returns a point of interest (POI) that minimizes an aggregate function for multiple query points. In this paper, we propose an efficient approach to tackle ANN queries in road networks. Our approach consists of two phases: searching phase and pruning phase. In particular, we first continuously compute the nearest neighbors (NNs) for each query point in some specific order to obtain the candidate POIs until all query points find a common POI. Second, we filter out the unqualified POIs based on the pruning strategy for a given aggregate function. The two-phase process is repeated until there remains only one candidate POI, and the remained one is returned as the final result. In addition, we discuss the partition strategies for query points and the approximate ANN query for the case where the number of query points is huge. Extensive experiments using real datasets demonstrate that our proposed approach outperforms its competitors significantly in most cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yiu M L, Mamoulis N, Papadias D. Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 820–833.

  2. Kolahdouzan M R, Shahabi C. Voronoi-based k nearest neighbor search for spatial network databases. In Proc. the 30th VLDB, Aug. 31-Sept. 3, 2004, pp. 840–851.

  3. Zhu L, Jing Y, Sun W, Mao D, Liu P. Voronoi-based aggregate nearest neighbor query processing in road networks. In Proc. the 18th ACM SIGSPATIAL GIS, Nov. 2010, pp. 518–521.

  4. Guttman A. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD, June 1984, pp. 47–57.

  5. Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In Proc. ACM SIGMOD, May 1995, pp. 71–79.

  6. Cheung K L, Fu A W. Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record, 1998, 27(3): 16–21.

  7. Hjaltason G, Samet H. Distance browsing in spatial databases. ACM Transactions on Database Systems, 1999, 24(2): 265–318.

  8. Papadopoulos A, Manolopoulos Y. Performance of nearest neighbor queries in R-trees. In Proc. the 6th ICDT, Jan. 1997, pp. 394–408.

  9. Tao Y, Papadias D, Shen Q. Continuous nearest neighbor search. In Proc. the 28th VLDB, Aug. 2002, pp. 287–298.

  10. Hu H, Lee D L. Range nearest-neighbor query. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 78–91.

  11. Gao Y, Zheng B. Continuous obstructed nearest neighbor queries in spatial databases. In Proc. ACM SIGMOD, June 29–July 2, 2009, pp. 577–590.

  12. Tao Y, Yiu M L, Mamoulis N. Reverse nearest neighbor search in metric spaces. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(9): 1239–1252.

  13. Nutanong S, Tanin E, Zhang R. Visible nearest neighbor querying. In Proc. the 12th DASFAA, Apr. 2007, pp. 876–883.

  14. Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Closest pair queries in spatial databases. In Proc. ACM SIGMOD, May 2000, pp. 189–200.

  15. Papadias D, Shen Q, Tao Y, Mouratidis K. Group nearest neighbor queries. In Proc. the 20th ICDE, Mar. 30–Apr. 2, 2004, pp. 301–312. Deviation (%)

  16. Papadias D, Tao Y, Mouratidis K, Hui C K. Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems, 2005, 30(2): 529–576.

  17. Jensen C S, Kolárvr J, Pedersen T B, Timko I. Nearest neighbor queries in road networks. In Proc. the 11th GIS, Nov. 2003, pp. 1–8.

  18. Papadias D, Zhang J, Mamoulis N, Tao Y. Query processing in spatial network databases. In Proc. the 29th VLDB, Sept. 2003, pp. 802–813.

  19. Huang X, Jensen C S, Šaltenis S. The islands approach to nearest neighbor querying in spatial networks. In Proc. the 9th SSTD, Aug. 2005, pp. 73–90.

  20. Kolahdouzan M R, Shahabi C. Continuous k-nearest neighbor queries in spatial network databases. In Proc. the 2nd STDBM, Aug. 2004, pp. 33–40.

  21. Yiu M L, Papadias D, Mamoulis N, Tao Y. Reverse nearest neighbors in large graphs. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(4): 540–553.

  22. Sankaranarayanan J, Alborzi H, Samet H. Distance join queries on spatial networks. In Proc. the 14th ACM GIS, Nov. 2006, pp. 211–218.

  23. Deng K, Zhou X, Shen H T. Multi-source skyline query processing in road networks. In Proc. the 23rd ICDE, Apr. 2007, pp. 796–805.

  24. Yan D, Zhao Z, Ng W. Efficient algorithms for finding optimal meeting point on road networks. In Proc. the 37th VLDB, Aug. 29–Sept. 3, 2011, pp. 968–979.

  25. Sharifzadeh M, Shahabi C, Kazemi L. Processing spatial skyline queries in both vector spaces and spatial network databases. ACM Transactions on Database Systems, 2009, 34(3): Article No. 14.

  26. Qin L, Yu J X, Ding B, Ishikawa Y. Monitoring aggregate k-NN objects in road networks. In Proc. the 20th SSDBM, July 2008, pp. 168–186.

  27. Elmongui H G, Mokbel M F, Aref W G. Continuous aggregate nearest neighbor queries. GeoInformatica, 2013, 17(1): 63–95.

  28. Li J, Yiu M L, Mamoulis N. Efficient notification of meeting points for moving groups via independent safe regions. In Proc. the 29th ICDE, Apr. 2013, pp. 422–433.

  29. Chen K, Sun W, Tu C, Chen C, Huang Y. Aggregate keyword routing in spatial database. In Proc. the 20th ACM SIGSPATIAL GIS, Nov. 2012, pp. 430–433.

  30. Hashem T, Kulik L, Zhang R. Privacy preserving group nearest neighbor queries. In Proc. the 13th EDBT, Mar. 2010, pp. 489–500.

  31. Lian X, Chen L. Probabilistic group nearest neighbor queries in uncertain databases. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(6): 809–824.

  32. Liu Z, Wang C, Wang J. Aggregate nearest neighbor queries in uncertain graphs. World Wide Web, 2014, 17(1): 161–188.

  33. Hakimi S L, Labbé M, Schmeichel E F. The Voronoi partition of a network and its implications in location theory. INFORMS Journal on Computing, 1992, 4(4): 412–417.

  34. Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S H. On trip planning queries in spatial databases. In Proc. the 9th SSTD, Aug. 2005, pp. 273–290.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Fudan University, Shanghai, 201203, China

    Wei-Wei Sun, Chu-Nan Chen, Liang Zhu & Yi-Nan Jing

  2. Shanghai Key Laboratory of Data Science, Fudan University, Shanghai, 201203, China

    Wei-Wei Sun, Chu-Nan Chen, Liang Zhu & Yi-Nan Jing

  3. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Yun-Jun Gao

  4. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China

    Qing Li

Authors
  1. Wei-Wei Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chu-Nan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yun-Jun Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yi-Nan Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Qing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei-Wei Sun.

Additional information

This research is supported in part by the Shanghai Natural Science Foundation of China under Grant No. 14ZR1403100, the Shanghai Science and Technology Development Funds of China under Grant Nos. 13dz2260200 and 13511504300, and the National Natural Science Foundation of China under Grant No. 61073001.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, WW., Chen, CN., Zhu, L. et al. On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks. J. Comput. Sci. Technol. 30, 781–798 (2015). https://doi.org/10.1007/s11390-015-1560-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-015-1560-z

Keywords

Search

Navigation