Abstract
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are suitable for storing 2-dimensional regional data and their linear variant is used in many Geographical Information Systems for this purpose. In this report, we present five algorithms suitable for processing join queries between these two successful, although very different, access methods. Two of the algorithms are based on heuristics that aim at minimizing I/O cost with a limited amount of main memory. We also present the results of experiments performed with real data that compare the I/O performance of these algorithms.
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
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel and J.S. Vitter, “Scalable Sweeping-Based Spatial Join”, Proceedings of the 24th VLDB conference, New York, 1998, pp. 570–581.
N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger, “The R*-tree: an Eficient and Robust Access Method for Points and Rectangles”, Proceedings of the 1990 ACM SIGMOD Conference, Atlantic City, NJ, pp. 322–331.
T. Brinkhoff, H.P. Kriegel and B. Seeger, “Eficient Processing of Spatial Joins Using R-trees”, Proceedings of the 1993 ACM SIGMOD Conference, Washington, DC, pp. 237–246.
T. Brinkhoff, H.P. Kriegel and B. Seeger, “Parallel Processing of Spatial Joins Using R-trees”, International Conference on Data Engineering, New Orleans, 1996, pp. 258–265.
E.G. Hoel and H. Samet, “Benchmarking Spatial Join Operations with Spatial Output”, Proceedings of the 21st VLDB conference, Zurich, 1995, pp. 606–618.
V. Gaede and O. Guenther: “Multidimensional Access Methods”, ACM Computer Surveys, Vol 30, No 2, 1998, pp. 170–231.
A. Guttman: “R-trees-a Dynamic Index Structure for Spatial Searching”, Proceedings of the 1984 ACM SIGMOD Conference, Boston, MA, pp. 47–57.
N. Koudas and K.C. Sevcik, “Size Separation Spatial Join”, Proceedings of the 1997 ACM SIGMOD Conference, Tuscon, pp. 324–335.
M.L. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees”, Proceedings of the 1994 ACM SIGMOD Conference, Minneapolis, pp. 209–220.
M.L. Lo and C.V. Ravishankar, “Generating Seeded Trees From Data Sets”, Proceedings of the 4th International Symposium on Large Spatial Databases, Portland, ME, 1995, pp. 328–347.
M.L. Lo and C.V. Ravishankar, “Spatial Hash-Joins”, Proceedings of the 1996 ACM SIGMOD Conference, Montreal, Canada, pp. 247–258.
K. Mehlhorn, “Data Structures and Algorithms 3: Multi-dimentional Searching and Computational Geometry”, Springer Verlag, 1984.
J.A. Orenstein and F.A. Manola, “PROBE Spatial Data Modeling and Query Processing in an Image Database Application”, IEEE transactions on Software Engineering, Vol 14, No 5, 1988, pp. 611–629.
J.A. Orenstein, “Spatial Query Processing in an Object Oriented Database System”, Proceedings of the 1986 ACM SIGMOD Conference, pp. 326–336.
J.M. Patel and D.J. DeWitt, “Partition Based Spatial Merge-Join”, Proceedings of the 1996 ACM SIGMOD Conference, Montreal, pp. 259–270.
A. Papadopoulos and Y. Manolopoulos, “Similarity Query Processing using Disk Arrays”, Proceedings of the 1998 ACM SIGMOD Conference, Seattle, pp. 225236.
F.P. Preparata and M.I. Shamos, “Computational Geometry”, Springer Verlag, 1988.
N. Roussopoulos and D. Leifker, “Direct Spatial Search on Pictorial Databases using Packed R-trees”, Proceedings of the 1985 ACM SIGMOD Conference, Austin, TX, pp. 17–31.
H. Samet, C.A. Shaffer, R.C. Nelson, Y.G. Huang, K. Fujimura and A. Rosenfeld, “Recent Developments in Linear Quadtree-based Geographic Information Systems”, Image and Vision Computing, Vol 5, No 3, 1987, pp. 187–197.
H. Samet: “The Design and Analysis of Spatial Data Structures”, Addison-Wesley, Reading MA, 1990.
H. Samet: “Applications of Spatial Data Structures”, Addison-Wesley, Reading MA, 1990.
T. Sellis, N. Roussopoulos and C. Faloutsos: “The R+tree-a Dynamic Index for Multi-Dimensional Objects”, Proceedings of the 13th VLDB conference, 1987, pp. 507–518.
J. Sharma: “Implementation of Spatial and Multimedia Extensions in Commercial Systems”, tutorial during the 6th International Symposium on Spatial Databases, Hong Kong, July 20–23, 1999.
M. Vassilakopoulos and Y. Manolopoulos, “Dynamic Inverted Quadtree: a Structure for Pictorial Databases”, Information Systems (special issue on Multimedia), Vol 20, No 6, 1995, pp. 483–500.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corral, A., Vassilakopoulos, M., Manolopoulos, Y. (1999). Algorithms for Joining R-Trees and Linear Region Quadtrees. In: Güting, R.H., Papadias, D., Lochovsky, F. (eds) Advances in Spatial Databases. SSD 1999. Lecture Notes in Computer Science, vol 1651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48482-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-48482-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66247-1
Online ISBN: 978-3-540-48482-0
eBook Packages: Springer Book Archive