By Topic

Parallel spatial join algorithms using grid files

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)
Jin-Deog Kim ; Group Dept. of Info-Commun., Pusan Info-Tech. Coll., South Korea ; Bong-Hee Hong

The most costly spatial operation in spatial databases is a spatial join which combines objects from two data sets based on spatial predicates such as intersects or contains. Even if the execution time of sequential spatial join processing has improved over the last few years, the response time is far from meeting the requirements of interactive users. In this paper, we have designed two kinds of parallel spatial join algorithms based on grid files: a parallel spatial join using a multi-assignment grid file and a parallel spatial join using a single-assignment grid file. Three kinds of methods of task allocation for improving their performances: static, dynamic, and semi-dynamic, have been examined for determining which task allocation strategy bused on grid files shows the best performance. The experimental tests have been conducted on a MIMD parallel machine with shared disks. We conclude that the first join algorithm based on disjoint decomposition of data space outperforms the second based on non-disjoint decomposition. Also, the semi-dynamic task allocation method is the best

Published in:

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date of Conference: