By Topic

Graph partition based multi-way 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
$31 $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

3 Author(s)
Xuemin Lin ; Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia ; Hai-Xin Lu ; Qing Zhang

We investigate the problem of efficiently computing a multi-way spatial join without spatial indexes. We propose a novel and effective filtering algorithm based on a two phase partitioning technique. To avoid missing hits due to an inherent difficulty in multi-way spatial joins, we propose to firstly partition a join graph into sub-graphs whenever necessary. In the second phase, we partition the spatial data sets; and then the sub-joins will be executed simultaneously in each partition to minimise the I/O costs. Finally, a multi-way relational join is applied to merge together the sub-join results. Our experiment results demonstrate the effectiveness and efficiency of the proposed algorithm.

Published in:

Database Engineering and Applications Symposium, 2002. Proceedings. International

Date of Conference:

2002