Cost-Based Optimization of Integration Flows - Datenbanken ...

List of Figures
3.27 Workload Adaptation Delays . . . . . . . . . . . . . . . . . . . . . . . . . . 82
3.28 Influence of Parameters on the Sensibility of Workload Adaptation . . . . . 83
3.29 Comparison Scenario of Periodical Re-Optimization with Correlation . . . . 85
4.1 Example Instance-Based Execution of Plan P 2 . . . . . . . . . . . . . . . . 90
4.2 Example Fully Vectorized Execution of Plan P 2 ′ . . . . . . . . . . . . . . . . 90
4.3 Temporal Aspects of Instance-Based and Vectorized Plans . . . . . . . . . . 91
4.4 Conceptual Model of Execution Buckets . . . . . . . . . . . . . . . . . . . . 93
4.5 Example Plan Vectorization . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
4.6 Rewriting Switch Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
4.7 Rewriting Invoke Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
4.8 Speedup Test with Varying Degree of Parallelism . . . . . . . . . . . . . . . 100
4.9 Example Cost-Based Plan Vectorization . . . . . . . . . . . . . . . . . . . . 101
4.10 Spectrum of Cost-Based Vectorization . . . . . . . . . . . . . . . . . . . . . 101
4.11 Work Cycle Domination by Operator o 3 . . . . . . . . . . . . . . . . . . . . 102
4.12 Plan-Dependent Search Space . . . . . . . . . . . . . . . . . . . . . . . . . . 103
4.13 Bucket Merging with Different λ . . . . . . . . . . . . . . . . . . . . . . . . 108
4.14 Heuristic Operator Distribution with Fixed k . . . . . . . . . . . . . . . . . 111
4.15 Example Operator Awareness . . . . . . . . . . . . . . . . . . . . . . . . . . 112
4.16 Problem of Solving P-CPV for all Plans . . . . . . . . . . . . . . . . . . . . 114
4.17 Heuristic Multiple Plan Vectorization . . . . . . . . . . . . . . . . . . . . . . 116
4.18 Example Periodical Re-Optimization . . . . . . . . . . . . . . . . . . . . . . 118
4.19 Use Case Comparison of Vectorization . . . . . . . . . . . . . . . . . . . . . 120
4.20 Evaluated Example Plan P m . . . . . . . . . . . . . . . . . . . . . . . . . . 121
4.21 Scalability Comparison with Different Influencing Factors . . . . . . . . . . 122
4.22 Latency Time and Execution Time of Single Messages (for n = 250) . . . . 124
4.23 Vectorization Deployment Overhead . . . . . . . . . . . . . . . . . . . . . . 125
4.24 Influence of λ with Different Numbers of Operators and Data Sizes . . . . . 126
4.25 Restricting k with Different Numbers of Operators and Data Sizes . . . . . 127
5.1 Example Instance-Based Plan Execution . . . . . . . . . . . . . . . . . . . . 130
5.2 Example Message Batch Plan Execution . . . . . . . . . . . . . . . . . . . . 131
5.3 Common Cases of Rewritten Queries to External Systems . . . . . . . . . . 132
5.4 Query Execution Times . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132
5.5 Partitioned Message Batch Execution P 2 ′ . . . . . . . . . . . . . . . . . . . . 133
5.6 Example Partition Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
5.7 Example Hash Partition Tree . . . . . . . . . . . . . . . . . . . . . . . . . . 137
5.8 Inverse Operators PSplit and PMerge . . . . . . . . . . . . . . . . . . . . . 140
5.9 Example Plan Rewriting Using the Split and Merge Approach . . . . . . . . 140
5.10 P-MFO Temporal Aspects (with ∆tw > W (P ′ )) . . . . . . . . . . . . . . . 143
5.11 Relative Execution Time W (P 2 ′, k′ )/k ′ . . . . . . . . . . . . . . . . . . . . . 145
5.12 Search Space for Waiting Time Computation . . . . . . . . . . . . . . . . . 147
5.13 Monotonically Non-Increasing Execution Time with Lower Bound . . . . . 152
5.14 Waiting Time Computation With Skewed Message Arrival Rate . . . . . . . 154
5.15 Use Case Comparison of Multi-Flow Optimization . . . . . . . . . . . . . . 157
5.16 Use Case Scalability Comparison with Varying Data Size d . . . . . . . . . 159
5.17 Use Case Scalability Comparison with Varying Batch Size k ′ . . . . . . . . 159
5.18 Execution Time W (P 2 ′, k′ ) with Varying Batch Size k ′ . . . . . . . . . . . . 160
220