Exploiting Interactions among Query Rewrite Rules in the Teradata DBMS

  • Authors:
  • Ahmad Ghazal;Dawit Seid;Alain Crolotte;Bill Mckenna

  • Affiliations:
  • Teradata Corporation 90245;Teradata Corporation 90245;Teradata Corporation 90245;Teradata Corporation 90245

  • Venue:
  • DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Query rewrite (QRW) optimizations apply algebraic transformations to a SQL query Q producing a SQL query Q'. Both Q and Q' are semantically equivalent (i.e. they produce the same result) but the execution of Q' is generally faster than that of Q. Folding views/derived tables, applying transitive closure on predicates, and converting outer joins to inner joins are some examples of QRW optimizations. In this paper, we carefully analyze the interactions among a number of rewrite rules and show how this knowledge is used to devise a triggering mechanism in the new Teradata extensible QRW subsystem thereby enabling efficient application of the rewrite rules. We also present results from experimental studies that show that, as compared to a conventional recognize-act cycle strategy, exploiting these interactions yields significant reduction in the time and space cost of query optimization while producing the same re-written queries.