Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query

George Roumelis, Michael Vassilakopoulos, Antonio Corral, Yannis Manolopoulos

Abstract

One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications is the (K) Group Nearest Neighbor Query (GNNQ), that discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group). This query has been studied during the recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed data sets, since this case is frequent in practical applications. And we present two (RAM-based) Plane-Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm.

References

  1. Ahn, H., Bae, S. W., and Son, W. (2013). Group nearest neighbor queries in the L 1 plane. In TAMC Conference, pages 52-61. Springer.
  2. Hashem, T., Kulik, L., and Zhang, R. (2010). Privacy preserving group nearest neighbor queries. In EDBT Conference, pages 489-500. ACM.
  3. Hinrichs, K., Nievergelt, J., and Schorn, P. (1988). Planesweep solves the closest pair problem elegantly. Information Processing Letters, 26(5):255-261.
  4. Jacox, E. H. and Samet, H. (2007). Spatial join techniques. ACM Trans. Database Syst., 32(1):7.
  5. Jiang, T., Gao, Y., Zhang, B., Liu, Q., and Chen, L. (2013). Reverse top-k group nearest neighbor search. In WAIM Conference, pages 429-439. Springer.
  6. Li, H., Lu, H., Huang, B., and Huang, Z. (2005). Two ellipse-based pruning methods for group nearest neighbor queries. In ACM-GIS Conference, pages 192-199. ACM.
  7. Li, J., Wang, B., Wang, G., and Bi, X. (2014). Efficient processing of probabilistic group nearest neighbor query on uncertain data. In DASFAA Conference, pages 436- 450. Springer.
  8. Lian, X. and Chen, L. (2008). Probabilistic group nearest neighbor queries in uncertain databases. IEEE Trans. Knowl. Data Eng., 20(6):809-824.
  9. Luo, Y., Chen, H., Furuse, K., and Ohbo, N. (2007). Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In ICCSA Conference, pages 821-833. Springer.
  10. Namnandorj, S., Chen, H., Furuse, K., and Ohbo, N. (2008). Efficient bounds in finding aggregate nearest neighbors. In DEXA Conference, pages 693-700. Springer.
  11. Papadias, D., Shen, Q., Tao, Y., and Mouratidis, K. (2004). Group nearest neighbor queries. In ICDE Conference, pages 301-312. IEEE.
  12. Papadias, D., Tao, Y., Mouratidis, K., and Hui, C. K. (2005). Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst., 30(2):529- 576.
  13. Preparata, F. P. and Shamos, M. I. (1985). Computational Geometry - An Introduction. Springer, New York, NY.
  14. Rigaux, P., Scholl, M., and Voisard, A. (2002). Spatial databases - with applications to GIS. Elsevier, San Francisco, CA.
  15. Roumelis, G., Vassilakopoulos, M., Corral, A., and Manolopoulos, Y. (2014). A new plane-sweep algorithm for the k-closest-pairs query. In SOFSEM Conference, pages 478-490. Springer.
  16. Zhang, D., Chan, C., and Tan, K. (2013). Nearest group queries. In SSDBM Conference, page 7. ACM.
  17. Zhu, L., Jing, Y., Sun, W., Mao, D., and Liu, P. (2010). Voronoi-based aggregate nearest neighbor query processing in road networks. In ACM-GIS Conference, pages 518-521. ACM.
Download


Paper Citation


in Harvard Style

Roumelis G., Vassilakopoulos M., Corral A. and Manolopoulos Y. (2015). Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query . In Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM, ISBN 978-989-758-099-4, pages 83-93. DOI: 10.5220/0005375300830093


in Bibtex Style

@conference{gistam15,
author={George Roumelis and Michael Vassilakopoulos and Antonio Corral and Yannis Manolopoulos},
title={Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query},
booktitle={Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,},
year={2015},
pages={83-93},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005375300830093},
isbn={978-989-758-099-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,
TI - Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query
SN - 978-989-758-099-4
AU - Roumelis G.
AU - Vassilakopoulos M.
AU - Corral A.
AU - Manolopoulos Y.
PY - 2015
SP - 83
EP - 93
DO - 10.5220/0005375300830093