An Efficient Heuristic for Logical Optimization of ETL Workflows
Citations
54 citations
Cites background or methods from "An Efficient Heuristic for Logical ..."
...[11] propose the dependency graph that is used for narrowing the space of allowed rearrangements of tasks within a given workflow....
[...]
...The optimization concept contributed in [11] draws upon the idea of rearranging tasks (activities) in an ETL workflow (as proposed in [12]), in order to construct a more efficient variant of thisworkflow....
[...]
...The following assumptions aremade in [11]:...
[...]
...[11] introduced a dependency graph—a structure that represents dependencies between tasks in aworkflow....
[...]
...Finding an optimal execution plan is based on: (1) identifying different possible re-orderings of operators (tasks, activities) in a given SE and (2) estimating their execution costs, in the spirit of [11,12]....
[...]
34 citations
29 citations
Cites background from "An Efficient Heuristic for Logical ..."
...Most of the papers [17, 23, 16, 14, 21] focused on conceptual modeling of ETL optimization....
[...]
...[14] touches upon efficient heuristics for logical optimization of the ETL workflows....
[...]
18 citations
12 citations
Additional excerpts
...The algorithm is presented in [12]....
[...]
References
4,242 citations
"An Efficient Heuristic for Logical ..." refers methods in this paper
...We have used a simple cost Model described in [13]....
[...]
2,820 citations
393 citations
"An Efficient Heuristic for Logical ..." refers background in this paper
...At the Conceptual level [2,3] details like source schema, target schema and the relationships between their attributes are defined....
[...]
353 citations
"An Efficient Heuristic for Logical ..." refers background in this paper
...A Data Warehouses(DW) [1] plays an important role in decision making for any organization....
[...]
218 citations
Additional excerpts
...The State Space based algorithms described in [14,8] consider only the converging linear groups (i....
[...]