Parallel R-Tree Spatial Join for a Shared-Nothing Architecture

The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This paper proposes a Replicated Parallel Packed R-tree and its use in performing the parallel R-tree join. We examine performance using the Digital Chart of the World Data on a shared nothing machine. Our experimental results show that the proposed tree and heuristics for load balancing improve Parallel R-tree join.

• Type: Conference
• Year: 1999
• Where: DANTE
• Authors: Lawrence Mutenda, Masaru Kitsuregawa
• Keywords: DANTE 1999, Database, Parallel R-tree Join, Spatial, Spatial Data