Partial join order optimization in the paraccel analytic database

  • Authors:

  • Yijou Chen;Richard L. Cole;William J. McKenna;Sergei Perfilov;Aman Sinha;Eugene Szedenits, Jr.

  • Affiliations:

  • ParAccel, Inc., Cupertino, CA, USA;ParAccel, Inc., Cupertino, CA, USA;ParAccel, Inc., Cupertino, CA, USA;ParAccel, Inc., Cupertino, CA, USA;ParAccel, Inc., Cupertino, CA, USA;ParAccel, Inc., Cupertino, CA, USA

  • Venue:
  • Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ParAccel Analytic Database is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enhanced query optimizer. This modern object-oriented optimizer and its optimizer framework, known as Volt, provide efficient bulk and instance level query expression representation, multiple expression managers, and rule and cost-based expression transformation organized via multiple optimizer instances. Volt has been applied to the problem of ordering very large numbers of joins by partially ordering them for subsequent optimization using standard dynamic programming. Performance analyses show the framework's utility and the optimizer's effectiveness.