Cost-Based Optimization of Integration Flows - Datenbanken ...
Cost-Based Optimization of Integration Flows - Datenbanken ...
Cost-Based Optimization of Integration Flows - Datenbanken ...
- No tags were found...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
List <strong>of</strong> Figures<br />
1.1 Overview <strong>of</strong> the Structure <strong>of</strong> this Thesis . . . . . . . . . . . . . . . . . . . . 4<br />
2.1 Classification <strong>of</strong> <strong>Integration</strong> Approaches . . . . . . . . . . . . . . . . . . . . 6<br />
2.2 Reference System Architecture for <strong>Integration</strong> <strong>Flows</strong> . . . . . . . . . . . . . 8<br />
2.3 Classification <strong>of</strong> Modeling Approaches for <strong>Integration</strong> <strong>Flows</strong> . . . . . . . . . 9<br />
2.4 <strong>Integration</strong> Flow Modeling with Directed Graphs and Hierarchies <strong>of</strong> Sequences 10<br />
2.5 <strong>Integration</strong> Flow Modeling with Directed Graphs . . . . . . . . . . . . . . . 11<br />
2.6 Classification <strong>of</strong> Execution Approaches for <strong>Integration</strong> <strong>Flows</strong> . . . . . . . . 15<br />
2.7 Classification <strong>of</strong> Adaptive Query Processing . . . . . . . . . . . . . . . . . . 19<br />
2.8 Use Cases <strong>of</strong> the Example Scenario w.r.t. the Information System Pyramid 27<br />
2.9 Example Horizontal <strong>Integration</strong> <strong>Flows</strong> . . . . . . . . . . . . . . . . . . . . . 28<br />
2.10 Example <strong>Integration</strong> Flow – Plan P 4 . . . . . . . . . . . . . . . . . . . . . . 29<br />
2.11 Example Vertical <strong>Integration</strong> <strong>Flows</strong> . . . . . . . . . . . . . . . . . . . . . . . 31<br />
3.1 Extended Reference System Architecture . . . . . . . . . . . . . . . . . . . . 35<br />
3.2 Example Dependency Graph and its Application . . . . . . . . . . . . . . . 38<br />
3.3 General Model <strong>of</strong> Operator Execution Statistics . . . . . . . . . . . . . . . . 39<br />
3.4 Plan <strong>Cost</strong> Estimation Example . . . . . . . . . . . . . . . . . . . . . . . . . 44<br />
3.5 Temporal Aspects <strong>of</strong> the P-PPO . . . . . . . . . . . . . . . . . . . . . . . . 46<br />
3.6 Example Execution Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . 46<br />
3.7 Example Execution <strong>of</strong> the <strong>Optimization</strong> Algorithm . . . . . . . . . . . . . . 50<br />
3.8 Example Critical Path <strong>Optimization</strong> . . . . . . . . . . . . . . . . . . . . . . 51<br />
3.9 Join Enumeration Example Plans . . . . . . . . . . . . . . . . . . . . . . . . 53<br />
3.10 Heuristic Join Reordering Example . . . . . . . . . . . . . . . . . . . . . . . 54<br />
3.11 <strong>Cost</strong>-<strong>Based</strong> <strong>Optimization</strong> Techniques . . . . . . . . . . . . . . . . . . . . . . 60<br />
3.12 Example Rescheduling Parallel <strong>Flows</strong> . . . . . . . . . . . . . . . . . . . . . . 61<br />
3.13 Example Rewriting Sequences to Parallel <strong>Flows</strong> . . . . . . . . . . . . . . . . 63<br />
3.14 Example Merging Parallel <strong>Flows</strong> . . . . . . . . . . . . . . . . . . . . . . . . 65<br />
3.15 Example Reordering and Merging <strong>of</strong> Switch Paths . . . . . . . . . . . . . . 67<br />
3.16 Example Control-Flow-Aware Selection Reordering . . . . . . . . . . . . . . 68<br />
3.17 Example Eager Group-By Application . . . . . . . . . . . . . . . . . . . . . 70<br />
3.18 Example Setoperation Type Selection . . . . . . . . . . . . . . . . . . . . . 72<br />
3.19 Example Setoperation <strong>Cost</strong> Comparison . . . . . . . . . . . . . . . . . . . . 72<br />
3.20 Comparison Scenario Periodical Re-<strong>Optimization</strong> . . . . . . . . . . . . . . . 75<br />
3.21 Influence <strong>of</strong> <strong>Optimization</strong> Interval ∆t . . . . . . . . . . . . . . . . . . . . . . 76<br />
3.22 Use Case Comparison <strong>of</strong> Periodical Re-<strong>Optimization</strong> . . . . . . . . . . . . . 77<br />
3.23 Speedup <strong>of</strong> Rewriting Sequences to Parallel <strong>Flows</strong> . . . . . . . . . . . . . . 78<br />
3.24 Use Case Scalability Comparison <strong>of</strong> Periodical Re-<strong>Optimization</strong> . . . . . . . 80<br />
3.25 <strong>Optimization</strong> Overhead <strong>of</strong> Join Enumeration . . . . . . . . . . . . . . . . . 81<br />
3.26 Cumulative Statistic Maintenance Overhead . . . . . . . . . . . . . . . . . . 81<br />
219