|
 
|
[GR00] The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
Conférence Internationale avec comité de lecture : Intl. Conf. on Scientific and Statistical Databases (SSDBM), January 2000,
motcle:
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.
Commentaires:
Berlin, Allemagne
BibTeX
| @inproceedings { | |||
| GR00, | |||
| title | = | "{The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins}", | |
| author | = | " C. Gurret and P. Rigaux ", | |
| booktitle | = | "{Intl. Conf. on Scientific and Statistical Databases (SSDBM)}", | |
| year | = | 2000, | |
| month | = | "January", | |
| note | = | "{Berlin, Allemagne}", | |
| } | |||
