Master-Client R-Trees: A New Parallel R-Tree Architecture

  • Authors:
  • Bernd Schnitzer;Scott T. Leutenegger

  • Affiliations:
  • -;-

  • Venue:
  • SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scientific databases must be able to efficiently run subset retrievals of multi-dimensional data sets. If the data sets are very large significant retrieval speedups can be obtained via parallelism. In this paper we present a new parallel distributed shared nothing Rtree architecture. To the best of our knowledge this is the first significant experimental study demonstrating practical application of parallel Rtrees in a shared nothing environment. %We argue that our new architecture is better than those proposed % Bernd %in the past and provide experimental results demonstrating % Bernd %actual speedups for several synthetic and real data sets. % Bernd We provide experimental results demonstrating % Bernd actual speedups for several synthetic and real data sets. % Bernd In addition, we conduct experimental studies to investigate the effect of several declustering strategies and communication parameters.