Block optimization in the Teradata RDBMS

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Block optimization involves several techniques used to avoid optimizing blocks or parts of a query separately. This process may involve integrating views, derived tables, and subqueries with the rest of the query. For those query blocks that cannot be integrated with the rest of the query, the Teradata optimizer tries to simplify and optimize these blocks. Such optimizations can be achieved using the satisfiability test (checking if a set of conditions are satisfiable) and generating transitive closure, which allows pushing constraints into and out of query blocks. Several new Block Optimization techniques, added to the new release of Teradata DBMS (V2R5), are described. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Ghazal, A., Bhashyam, R., & Crolotte, A. (2003). Block optimization in the Teradata RDBMS. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2736, 782–791. https://doi.org/10.1007/978-3-540-45227-0_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free