Skip to Main content Skip to Navigation
Conference papers

The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins

Abstract : We propose a new algorithm to solve the problem of joining two spatial relations $R$ and $S$ when $S$ is indexed by an R-tree. The method combines classical query processing techniques and a plane-sweeping algorithm. We compare our approach to the simple indexed-nested-loop method and to the state-of-the-art algorithms, and show through analysis and experiments on synthetic and real-life datasets that our method outperforms in most cases the other ones, both in CPU and I/O. More importantly it appears to be more robust regarding the many parameters involved in spatial query processing.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01124477
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:36:35 AM
Last modification on : Tuesday, December 3, 2019 - 2:52:22 PM

Identifiers

  • HAL Id : hal-01124477, version 1

Collections

Citation

C. Gurret, Philippe Rigaux. The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins. Intl. Conf. on Scientific and Statistical Databases (SSDBM), Jan 2000, X, France. ⟨hal-01124477⟩

Share

Metrics

Record views

44