By Topic

The sort/sweep algorithm: a new method for R-tree based spatial joins

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. Gurret ; CEDRIC/CNAM, Paris, France ; P. Rigaux

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

Published in:

Scientific and Statistical Database Management, 2000. Proceedings. 12th International Conference on

Date of Conference: