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

4 Vectorizing Integration Flows
(a) Latency WFPE
(b) Execution Time WFPE
(c) Latency VWFPE
(d) Execution Time VWFPE
(e) Latency CBVWFPE
(f) Execution Time CBVWFPE
Figure 4.22: Latency Time and Execution Time of Single Messages (for n = 250)
most time-consuming operator. This waiting time at inter-bucket queues is included in the
execution time of the whole plan. Note that the cost-based vectorized execution is faster
than the full vectorization but with non-linear scaling because the number of execution
buckets changed with increasing number of operators. Finally, the median of instancebased
execution is close to the minimum, while for vectorized execution, it is close to the
maximum. The substantiation is that there are only few messages (the first messages of a
sequence) without any waiting time within inter-bucket queues when executing vectorized
plans, while for all other messages, execution times include these waiting times.
Deployment and Maintenance
Furthermore, we evaluated the deployment and vectorization overhead with increasing
number operators in a static manner (without dynamic plan rewriting).
First, we measured the costs for the plan vectorization algorithm (A-PV) and the periodically
invoked cost-based plan vectorization algorithm (A-CPV). Figure 4.23 shows those
124