@article {16849,
	title = {Spatial join techniques},
	journal = {ACM Trans. Database Syst.},
	volume = {32},
	year = {2007},
	month = {2007/03//},
	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 = {external memory algorithms, plane-sweep, Spatial join},
	isbn = {0362-5915},
	doi = {10.1145/1206049.1206056},
	url = {http://doi.acm.org/10.1145/1206049.1206056},
	author = {Jacox,Edwin H. and Samet, Hanan}
}
