We define a new algorithm that allows the Teradata query optimizer to automatically derive and maintain constraints between date type columns across tables that are related by referential integrity constraints. We provide a novel, quantitative measure of the usefulness of such rules. We show how the Teradata query optimizer utilizes these constraints in producing more optimal plans especially for databases that have tables that are value ordered by date. We also discuss our design for maintaining these constraints in the presence of inserts, deletes, and updates to the relevant tables. Finally, we give performance numbers for seven TPC-H queries from our prototype implementation based on the Teradata Database engine.
CITATION STYLE
Ghazal, A., & Bhashyam, R. (2001). Dynamic constraints derivation and maintenance in the teradata RDBMS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2113, pp. 390–399). Springer Verlag. https://doi.org/10.1007/3-540-44759-8_39
Mendeley helps you to discover research relevant for your work.