Abstract
One of the most important operations in spatial access based systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. The paper gives contemporary state in this research area and presents effective algorithm for spatial joins which combines both I/O and CPU cost optimization. This algorithm is designed like a multi-step process [4] and uses combination of the algorithms described in the previous paper [12]. Besides that several optimization of the basic R*-tree algorithms and some spatial join heuristics are described to reduce CPU time. The experimental results and analysis of compared methods are presented.
This work was partially supported by Russian Foundation for Basic Research under grant 95-01-00636, and UrbanSoft Ltd. under contract 35/95.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.Guttman. New features for relational database systems to support cad applications. PhD thesis, University of California, Berkeley, 1984.
K. K. Al-Taha and R. Barrera. Temporal data and GIS: An overview. In Proc. GIS/LIS’90, November 1990.
N. Beekmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322–331, Atlantic City, NJ, 1990.
T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 197–208, Minneapolis, Minn., 1994.
T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using r-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 237–246, 1993.
D.Ballard and C.Brown. Computer vision. Prentice Hall, 1982.
O. Guenther. Efficient computation of spatial joins. In The Ninth IEEE International Conference on Data Engineering, Vienna, Austria, April 1993.
J.A. Orenstein. Spatial query processing in an object-oriented database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 326–333, Washington, DC, 1986.
I. Kamel and C. Fauloutsos. Parallel R-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 195–204, San Diego, Calif., 1992.
M.-L. Lo and C.V. Ravishankar. Spatial join using seeded trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 209–220, Minneapolis, Minn., 1994.
D. Lomet. A review of recent work on multi-attribute access methods. ACM SIGMOD Record, 21(3):56–63, 1992.
M.G. Martynov. Variations of R-tree structure for indexing of spatial objects. In Proc. of the Int. Workshop on Advances in Databases and Information Systems — ADBIS’94 pages 217–221, Moscow, May 23–26 1994.
P. Mishra and M. Eich. Join processing in relational databases. Computer Surveys, 24(1):63–113, March 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 British Computer Society
About this paper
Cite this paper
Martynov, M.G. (1996). Spatial Joins and R-trees. In: Eder, J., Kalinichenko, L.A. (eds) Advances in Databases and Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1486-4_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1486-4_20
Publisher Name: Springer, London
Print ISBN: 978-3-540-76014-6
Online ISBN: 978-1-4471-1486-4
eBook Packages: Springer Book Archive