Filtering data flow in deductive databases
Proceedings on International conference on database theory
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The 3 R's of optimizing constraint logic programs: refinement, removal and reordering
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fundamentals of Data Warehouses
Fundamentals of Data Warehouses
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Data Integration under Integrity Constraints
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
State-Space Optimization of ETL Workflows
IEEE Transactions on Knowledge and Data Engineering
A framework for the design of ETL scenarios
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Hi-index | 0.00 |
One major contribution of data warehouses is to support better decision making by facilitating data analysis, and therefore data quality is of primary importance. ETL is the process that extracts, transforms, and ultimately loads data into target warehouses. Although ETL workflows can be designed by ETL tools, data exceptions are largely left to human analysis and handled inadequately. Early detection of exceptions helps to improve the stability and efficiency of ETL workflows. To achieve this goal, a novel approach, Backwards Constraint Propagation (BCP), is proposed that automatically analyzes ETL workflows and verifies the target-end restrictions at their earliest points. BCP builds an ETL graph out of a given ETL workflow, encodes the target-end restrictions as integrity constraints, and propagates them backwards from target to sources through the ETL graph by applying constraint projection rules. It is showed that BCP supports most relational algebra operators and data transformation functions.