Spatial join techniques

被引:134
作者
Jacox, Edwin H. [1 ]
Samet, Hanan [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, Ctr Automat Res, Inst Adv Comp Studies, College Pk, MD 20742 USA
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2007年 / 32卷 / 01期
关键词
algorithms; design; external memory algorithms; plane-sweep; spatial join;
D O I
10.1145/1206049.1206056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:44
相关论文
共 120 条
[1]   Caching strategies for spatial joins [J].
Abel D.J. ;
Gaede V. ;
Power R.A. ;
Zhou X. .
GeoInformatica, 1999, 3 (1) :33-59
[2]  
Abel DJ, 1995, LECT NOTES COMPUT SC, V951, P348
[3]  
An N, 2001, PROC INT CONF DATA, P368, DOI 10.1109/ICDE.2001.914849
[4]  
[Anonymous], 1995, P 21 INT C VER LARG
[5]  
[Anonymous], 2003, P 2003 ACM SIGMOD IN, DOI DOI 10.1145/872757.872813
[6]  
[Anonymous], P 8 ACM INT S ADV GE
[7]  
[Anonymous], P SIGMOD
[8]  
[Anonymous], P ACM GIS
[9]  
[Anonymous], INT J GEOGRAPH INF S
[10]  
[Anonymous], 2006, Foundations of Multidimensional and Metric Data Structures