Abstract
This paper addresses the problem of Group K-Nearest Neighbors (GKNN) queries in spatial network databases, and suggests a novel approach based on real network distances. This approach essentially uses network Voronoi diagram properties together with a progressive incremental network expansion for determining the inner network distances that are needed to obtain GKNN queries.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal C, Philip SY (2001) Outlier detection for high dimensional data. ACM SIGMOD Record 30(2):37–46
Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323
Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1998) Fast nearest neighbor search in medical image databases. In: Vijayaraman TM, Buchmann A, Mohan C, Sarda N (eds) Proceedings of the 22nd international conference on very large databases, San Francisco, United States, September 3–9, 1996. Morgan Kaufmann, San Francisco, pp 215–226
Kolahdouzan M, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: Nascimento M, Ozsu M, Kossmann D, Miller R, Blakeley J, Schiefer K (eds) Proceedings of the thirteenth international conference on very large databases, Toronto, Canada, August 31–September 03, 2004. Morgan Kaufmann, San Francisco, pp 840–851
Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Freytag J, Lockemann P, Abiteboul S, Carey M, Selinger P, Heyer A (eds) Proceedings of the 29th international conference on very large databases, Berlin, Germany, September 9–12, 2003. Morgan Kaufmann, San Francisco, pp 802–813
Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: Lomet D (ed) Proceedings of the 20th international conference on data engineering. Boston, MA, March 30–April 2, 2004. IEEE Computer Society, Washington, pp 301–312
Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. ACM SIGMOD Record 24(2):71–79
Safar M (2005) K nearest neighbor search in navigation systems. Mobil Inf Syst 1(3):207–224
Seidl T, Kriegel H-P (1998) Optimal multi-step k-nearest neighbor search. ACM SIGMOD Record 27(2):154–165
Acknowledgment
This research has been funded by the Research Administration at Kuwait University—Project No. EO 03/04.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Safar, M. Group K-Nearest Neighbors queries in spatial network databases. J Geogr Syst 10, 407–416 (2008). https://doi.org/10.1007/s10109-008-0067-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10109-008-0067-3