Spatial join techniques
Authors:
Open Access
- 1 March 2007
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 32 (1) , 7
Abstract
A variety of techniques for performing a spatial join are reviewed. Instead of just summarizing the literature and presenting each technique in its entirety, distinct components of the different techniques are described and each is decomposed into an overall framework for performing a spatial join. A typical spatial join technique consists of the following components: partitioning the data, performing internal-memory spatial joins on subsets of the data, and checking if the full polygons intersect. Each technique is decomposed into these components and each component addressed in a separate section so as to compare and contrast similar aspects of each technique. The goal of this survey is to describe the algorithms within each component in detail, comparing and contrasting competing methods, thereby enabling further analysis and experimentation with each component and allowing the best algorithms for a particular situation to be built piecemeal, or, even better, enabling an optimizer to choose which algorithms to use.Keywords
This publication has 83 references indexed in Scilit:
- Spatial join processing using corner transformationIEEE Transactions on Knowledge and Data Engineering, 1999
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtreesAlgorithmica, 1996
- Query evaluation techniques for large databasesACM Computing Surveys, 1993
- Join processing in relational databasesACM Computing Surveys, 1992
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphsJournal of Algorithms, 1989
- PROBE spatial data modeling and query processing in an image database applicationIEEE Transactions on Software Engineering, 1988
- A practical divide-and-conquer algorithm for the rectangle intersection problemInformation Sciences, 1987
- Space-economical plane-sweep algorithmsComputer Vision, Graphics, and Image Processing, 1986
- The Grid FileACM Transactions on Database Systems, 1984