Abstract
Spatial joins are very important but costly operations in spatial databases. A typical evaluation strategy of spatial joins is to perform the join on approximations of spatial objects and then evaluate the join of the real objects based on the results. The common approximation is the minimum bounding rectangle. Minimum bounding rectangles are coarse approximations of spatial objects and may cause a large number of “false hits”. In this paper, we consider a more general form of approximation with rectilinear polygons for spatial objects in the context of spatial join evaluation. A naive approach is to decompose rectilinear polygons into rectangles and use an exisiting rectangle join algorithm. This may require additional cost for sorting, index construction, and decomposition and prohibits the join evaluation to be pipelined. The main contribution of the paper is a technique for extending plane sweeping based rectangle join algorithms to perform a spatial join on rectilinear polygons directly. We show that the join of two sets of rectilinear polygons can be computed in O(bN log b N/ b + ℓ2k) IOs directly, where N is the total number of boundary points in each input set, ℓ the maximum number of boundary points of a rectilinear polygon, b the page size, and k the number of rectilinear polygon intersections. When the rectilinear polygons are y-monotone, the IO complexity becomes O(bN logb N/b + ℓk).
Support in part by NSF grants IRI-9700370 and IIS-9817432.
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. The buffer tree: A new technique for optimal I/O-algorithms. In Proc. Workshop on Algorithms and Data structures, 1995.
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter. Scalable sweeping based spatial join. In Proc. Int. Conf. on Very Large Data Bases, 1998.
L. Becker, K. Hinriches, and U. Finke. A new algorithm for computing joins with grid files. In Proc. Int. Conf. on Data Engineering, 1993.
N. Beckmann, 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, 1990.
J. L. Bentley. Algorithms for Klee’s rectangle problems. Technical report, Carnegie-Mellon University, 1977.
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, 1994.
T. Brinkhoff, H-P. Kriegel, and B. Seeger. Efficient processing of spatial join using R-trees. In Proc. Int. Conf. on Data Engineering, 1993.
L. Ferarri, P. V. Sankar, and J. Sklansky. Minimal rectangular partitions of digital blobs. In Proc. 5th Int. Conf. on Pattern Recogonition, 1980.
M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symp. on Foundations of Computer Science, 1993.
O. Günther. Efficient computation of spatial joins. In Proc. Int. Conf. on Data Engineering, 1993.
Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In Proc. Int. Conf. on Very Large Data Bases, 1997.
M. Kreveld, editor. Geographic Information systems. Utrecht University, 1995.
G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 1999.
R. Laurini and A. D. Thompson, editors. Fundamentals of Spatial Information Systems. Acedemic Press, 1992.
M-L. Lo and C. V. Ravishankar. Spatial hash-joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996.
J. A. Orenstein. Spatial query processing in an object-oriented database system. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1986.
J. A. Orenstein. Redundancy in spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1989.
J. A. Orenstein and F. A. Manola. PROBE spatial data modeling and query processing in an image datebase application. IEEE Trans. on Software Engineering, 14(5):611–629, 1988.
J. M. Patel and D. J. DeWitt. Partition based spatial-merge joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996.
D. Rotem. Spatial join indices. In Proc. Int. Conf. on Data Engineering, 1991.
H. Samet. Hierarchical representations of collections of small rectangles. ACM Computing Surveys, 20(4):271–309, 1988.
K. C. Sevcik and N. Koudas. Filter trees for managing spatial data over a range of size granularities. In Proc. Int. Conf. on Very Large Data Bases, 1996.
M. I. Shamos and D. Hoey. Geometric intersection problems. In Proc. IEEE Symp. on Foundations of Computer Science, 1976.
P. Valduriez. Join indices. ACM Trans. on Database Systems, 12(2):218–246, 1987.
H. Zhu, J. Su, and O. H. Ibarra. An index structure for spatial joins in linear constraint databases. In Proc. Int. Conf. on Data Engineering, 1999.
H. Zhu, J. Su, and O. H. Ibarra. Toward spatial joins for general polygons. Technical report, Dept. of Computer Science, U C Santa Barbara, 2000.
G. Zimbrao and J. M. Souza. A raster approximation for the processing of spatial joins. In Proc. Int. Conf. on Very Large Data Bases, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, H., Su, J., Ibarra, O.H. (2000). Extending Rectangle Join Algorithms for Rectilinear Polygons. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-45151-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67627-0
Online ISBN: 978-3-540-45151-8
eBook Packages: Springer Book Archive