The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01124477 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01124477 , version 1

Citer

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⟩

Collections

CNAM CEDRIC-CNAM
45 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More