Verification of partitioning and allocation techniques on teradata DBMS

  • Authors:

  • Ladjel Bellatreche;Soumia Benkrid;Ahmad Ghazal;Alain Crolotte;Alfredo Cuzzocrea

  • Affiliations:

  • LISI/ENSMA Poitiers University, Futuroscope, France;National High School for Computer Science, Algiers, Algeria;Teradata Corporation, San Diego, CA;Teradata Corporation, San Diego, CA;ICAR-CNR and University of Calabria, Italy

  • Venue:
  • ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data fragmentation and allocation in distributed and parallel Database Management Systems (DBMS) have been extensively studied in the past. Previous work tackled these two problems separately even though they are dependent on each other. We recently developed a combined algorithm that handles the dependency issue between fragmentation and allocation. A novel genetic solution was developed for this problem. The main issue of this solution and previous solutions is the lack of real life verifications of these models. This paper addresses this gap by verifying the effectiveness of our previous genetic solution on the Teradata DBMS. Teradata is a shared nothing DBMS with proven scalability and robustness in real life user environments as big as 10's of petabytes of relational data. Experiments are conducted for the genetic solution and previous work using the SSB benchmark (TPC-H like) on a Teradata appliance running TD 13.10. Results show that the genetic solution is faster than previous work by a 38%.