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

Authors:
Lawrence Mutenda;Masaru Kitsuregawa
Affiliations:
-;-
Venue:
DANTE '99 Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments
Year:
1999

Citing 0
Cited 3

Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Efficient parallel spatial join processing method in a shared-nothing database cluster system

ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Efficient parallel kNN joins for large data in MapReduce

Proceedings of the 15th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.