Recommended Reading
Beckmann N, Kriegel HP, Schneider R, Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.
Böhm C, Krebs F. The k-nearest neighbour join: turbo charging the KDD process. Knowl Inform Syst. 2004;6(6):728–49.
Chan EPF. Buffer queries. IEEE Trans Knowl Data Eng. 2003;15(4):895–910.
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Closest pair queries in spatial databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 2000. p. 189–200.
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Algorithms for processing K-closest-pair queries in spatial databases. Data Knowl Eng. 2004;49(1):67–104.
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Multi-way distance join queries in spatial databases. GeoInformatica. 2004;8(4):373–402.
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Cost models for distance joins queries using R-trees. Data Knowl Eng. 2006;57(1):1–36.
Hjaltason GR, Samet H. Incremental distance join algorithms for spatial databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 1998. p. 237–48.
Iwerks GS, Samet H, Smith K. Maintenance of spatial semijoin queries on moving points. In: Proceedings of 30th International Conference on Very Large Data Bases; 2004. p. 828–39.
Nanopoulos A, Theodoridis Y, Manolopoulos Y. C2P: clustering based on closest pairs. In: Proceedings of 27th International Conference on Very Large Data Bases; 2001. p. 331–40.
Papadopoulos AN, Nanopoulos A, Manolopoulos Y. Processing distance join queries with constraints. Comput J. 2006;49(3):281–96.
Shin H, Moon B, Lee S. Adaptive multi-stage distance join processing. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 2000. p. 343–54.
Shou Y, Mamoulis N, Cao H, Papadias D, Cheung D.W. Evaluation of iceberg distance joins. In: Proceedings of 8th International Symposium Advances in Spatial and Temporal Databases; 2003. p. 270–88.
Yang C, Lin K. An index structure for improving closest pairs and related join queries in spatial databases. In: Proceedings of International Conference on Database Engineering and Applications; 2002. p. 140–49.
Zhu M, Lee DL, Zhang J. k-closest pair query monitoring over moving objects. In: Proceedings of 3rd International Conference on Mobile Data Management; 2002. p. 14–14.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this entry
Cite this entry
Corral, A., Vassilakopoulos, M. (2014). Closest-Pair Query. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_67-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_67-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering