Optimizing equijoin queries in distributed databases where relations are hash partitioned

  • Authors:

  • Dennis Shasha;Tsong-Li Wang

  • Affiliations:

  • New York Univ., New York, NY;New York Univ., New York, NY

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider the class of distributed database systems consisting of a set of nodes connected by a high bandwidth network. Each node consists of a processor, a random access memory, and a slower but much larger memory such as a disk. There is no shared memory among the nodes. The data are horizontally partitioned often using a hash function. Such a description characterizes many parallel or distributed database systems that have recently been proposed, both commercial and academic. We study the optimization problem that arises when the query processor must repartition the relations and intermediate results participating in a multijoin query. Using estimates of the sizes of intermediate relations, we show (1) optimum solutions for closed chain queries; (2) the NP-completeness of the optimization problem for star, tree, and general graph queries; and (3) effective heuristics for these hard cases.Our general approach and many of our results extend to other attribute partitioning schemes, for example, sort-partitioning on attributes, and to partitioned object databases.