Abstract
In this paper, constrainedK clost pairs query is introduced, which retrieves theK closest pairs satisfying the given spatial constraint from two datasets. For data sets indexed by R-trees in spatial databases, three algorithms are presented for answering this kind of query. Among of them, two-phase Range + Join and Join + Range algorithms adopt the strategy that changes the execution order, of range and closest pairs queries, and constrained heap-based algorithm utilizes extended distance functions to prune search space and minimize the pruning distance. Experimental results show that constrained heap-based algorithms has better applicability and performance than two-phase algorithms.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Corral A, Manolopoulos Y, Theodoridis Y,et al. Closest Pair Queries in Spatial Databases [C]//Proceedings of ACM SIGMOD Conference. New York: ACM Press, 2000:189–200.
Yang C, Lin K I. An Index Structure for Improving Nearest Closest Pairs and Related Joint Queries in Spatial Databases [C]//Proceedings of International Database Engineering and Applications Symposium. Washington: IEEE Computer Society, 2002: 140–149.
Hjaltason G R, Samet H. Incremental Distance Joint Algorithms for Spatial Databases [C]//Proceedings of ACM SIGMOD Conference. New York: ACM Press, 1998:237–248.
Shin H, Moon B, Lee S. Adaptive Multi-Stage Distance Joint Processing [C]//Proceedings of ACM SIGMOD Conference. New York: ACM Press, 2000:343–354.
Corral A, Manolopoulos Y, Theodoridis Y,et al. Algorithms for ProcessingK-Closest-Pair Queries in Spatial Data-bases [J].Data & Knowledge Engineering, 2004,49(1): 67–104.
Jing Shan, Zhang, Donghui, Salzberg Betty. On Spatial-Range Closest-Pair Query [C]//Proceedings, of 8th Symposium on Spatial and Temporal Databases. New York: Springer, 2003:252–269.
Ferhatosmanoglu H, Stanoi I, Agrawal D,et al. Constrained Nearest Neighbor Queries [C]//7th International Symposium on Spatial and Temporal Databases. London, UK: Springer-Verlag, 2001:257–278.
Guttman. R-trees: A Dynamic Index Structure for Spatial Searching [C]//Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1984:47–57.
Beckmann N, Kriegel H P, Schneider R,et al. The R*-tree: an Efficient and Robust Access Method for Points and Rectangles [C]//Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1990:322–331.
Yannis T, Emmanuel S, Timos S. Cost Models for Join Queries in Spatial Databases [C]//Proceedings of the Fourteeth International Conference on Data Engineering. Washington: IEEE Computer Society, 1998:476–483.
Yannis T, Emmanuel S, Timos S. Efficient Cost Models for Spatial Queries Using R-trees [J].IEEE Transactions on Knowledge and Data Engineering, 2000,12(1):19–32.
Author information
Authors and Affiliations
Additional information
Foundation item: Supported by National Natural Science Foundation of China (60073045)
Biography: LIU Xiaofeng (1974-), male, Ph.D. candidate, research direction: spatiotemporal database spatial database, real-time database, etc.
Rights and permissions
About this article
Cite this article
Xiaofeng, L., Yungsheng, L. & Yingyuan, X. Processing constrainedK closest pairs query in spatial databases. Wuhan Univ. J. Nat. Sci. 11, 543–546 (2006). https://doi.org/10.1007/BF02836661
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02836661