Adaptive Parallel Query Execution in DBS3 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Adaptive Parallel Query Execution in DBS3

Luc Bouganim
Benont Dageville
  • Function : Author
Patrick Valduriez


The gains of parallel query execution can be limited because of high start-up time, interference between execution entities, and poor load balancing. In this paper, we present a solution which reduces these limitations in DBS3, a shared- memory parallel database system. This solution combines static data partitioni- ng (by hashing the relations across the disks) and dynamic processor allocation (using shared- memory) to adapt to the execution context. It makes DBS3 almost insensi tive to data skew and allows decoupling the degree of parallelism from the degree of data partitioning. To address the problem of load balancing in the presence of data skew, we analyze three important factors that influence the behavior of our parallel execution model: skew factor, degree of parallelism and degree of partitioning- . We report on experiments varying these three parameters with the DBS3 prototype on a 72-node KSR1 multiprocessor. The results demonstrate high performance gains, even with highly skewed data.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2749.pdf (255.99 Ko) Télécharger le fichier

Dates and versions

inria-00073943 , version 1 (24-05-2006)


  • HAL Id : inria-00073943 , version 1


Luc Bouganim, Benont Dageville, Patrick Valduriez. Adaptive Parallel Query Execution in DBS3. [Research Report] RR-2749, INRIA. 1995. ⟨inria-00073943⟩
40 View
153 Download


Gmail Facebook Twitter LinkedIn More