A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Size separation spatial join
Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97
We introduce a new algorithm to compute the spatial join of two or more spatial data sets, when indexes are not available on them. Size Separation Spatial Join (S3 J) imposes a hierarchical decomposition of the data space and, in contrast with previous approaches, requires no replication of entities from the input data sets. Thus its execution time depends only on the sizes of the joined data sets. We describe S3.J and present an analytical evaluation of its 1/0 and processor requirementsdoi:10.1145/253260.253340 dblp:conf/sigmod/KoudasS97 fatcat:digjphhffvhutilszov5heirui