Presentation	2000/7/21 DE2000-85 Issues in Parallel Rtree Join Processing for Large Spatial Data Sets Lawrence Mutenda, Masaru Kitsuregawa,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	GIS data sets continue to grow at a tremedous pace, NASA EOSDIS being a succint example. Processing such large sets requires efficient methods. In this paper we discuss issues surrounding storage and processing such data sets in a shared nothing environment. We examine several parallel R-tree structures for indexing these large spatial data sets. We especially focus on algorithms for employing the parallel R-trees in the filter phase of the parallel spatial R-tree-based join operation. We then discuss the filter phase of the join operation as relates spatial data declustering strategies, static and dynamic load balancing strategies and system scalability. We present preliminary experimental results on the join operation performed using the Digital Chart of the World Data data set on the IBM SP2 multi-computer.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	DE2000-85
Date of Issue

Conference Information
Committee	DE
Conference Date	2000/7/21(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Data Engineering (DE)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	DE2000-85 Issues in Parallel Rtree Join Processing for Large Spatial Data Sets
Sub Title (in English)
Keyword(1)
1st Author's Name	Lawrence Mutenda
1st Author's Affiliation	Institute of Industrial Science, The University of Tokyo()
2nd Author's Name	Masaru Kitsuregawa
2nd Author's Affiliation	Institute of Industrial Science, The University of Tokyo
Date	2000/7/21
Paper #	DE2000-85
Volume (vol)	vol.100
Number (no)	228
Page	pp.pp.-
#Pages	8
Date of Issue