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

More documents

Recommendations

Info

Contents 4.2 Plan Vectorization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 4.2.1 Overview and Meta Model Extension . . . . . . . . . . . . . . . . . . 89 4.2.2 Rewriting Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 4.2.3 Cost Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 4.3 Cost-Based Vectorization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99 4.3.1 Problem Generalization . . . . . . . . . . . . . . . . . . . . . . . . . 100 4.3.2 Computation Approach . . . . . . . . . . . . . . . . . . . . . . . . . 105 4.3.3 Cost-Based Vectorization with Restricted Number of Buckets . . . . 110 4.3.4 Operator-Aware Cost-Based Vectorization . . . . . . . . . . . . . . . 112 4.4 Cost-Based Vectorization for Multiple Plans . . . . . . . . . . . . . . . . . . 113 4.4.1 Problem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 4.4.2 Computation Approach . . . . . . . . . . . . . . . . . . . . . . . . . 114 4.5 Periodical Re-Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 4.6 Experimental Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 4.7 Summary and Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 5 Multi-Flow Optimization 129 5.1 Motivation and Problem Description . . . . . . . . . . . . . . . . . . . . . . 129 5.2 Horizontal Queue Partitioning . . . . . . . . . . . . . . . . . . . . . . . . . . 135 5.2.1 Maintaining Partition Trees . . . . . . . . . . . . . . . . . . . . . . . 135 5.2.2 Deriving Partitioning Schemes . . . . . . . . . . . . . . . . . . . . . 138 5.2.3 Plan Rewriting Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 139 5.3 Periodical Re-Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . 142 5.3.1 Formal Problem Definition . . . . . . . . . . . . . . . . . . . . . . . 142 5.3.2 Extended Cost Model and Cost Estimation . . . . . . . . . . . . . . 144 5.3.3 Waiting Time Computation . . . . . . . . . . . . . . . . . . . . . . . 146 5.3.4 Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 150 5.4 Formal Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151 5.4.1 Optimality Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 151 5.4.2 Maximum Latency Constraint . . . . . . . . . . . . . . . . . . . . . . 153 5.4.3 Serialized External Behavior . . . . . . . . . . . . . . . . . . . . . . 155 5.5 Experimental Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156 5.6 Summary and Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165 6 On-Demand Re-Optimization 167 6.1 Motivation and Problem Description . . . . . . . . . . . . . . . . . . . . . . 167 6.2 Plan Optimality Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 6.2.1 Formal Foundation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 6.2.2 Creating PlanOptTrees . . . . . . . . . . . . . . . . . . . . . . . . . 173 6.2.3 Updating and Evaluating Statistics . . . . . . . . . . . . . . . . . . . 175 6.3 Re-Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 6.3.1 Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 178 6.3.2 Updating PlanOptTrees . . . . . . . . . . . . . . . . . . . . . . . . . 180 6.4 Optimization Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181 6.4.1 Control-Flow- and Data-Flow-Oriented Techniques . . . . . . . . . . 181 6.4.2 Cost-Based Vectorization . . . . . . . . . . . . . . . . . . . . . . . . 185 6.4.3 Multi-Flow Optimization . . . . . . . . . . . . . . . . . . . . . . . . 186 6.4.4 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 viii
Contents 6.5 Experimental Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 6.6 Summary and Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 198 7 Conclusions 199 Bibliography 201 List of Figures 219 List of Tables 223 List of Algorithms 225 ix
Page 1: Cost-Based Optimization of Integrat
Page 4 and 5: of traditional data management syst
Page 7: Contents 1 Introduction 1 2 Prelimi
Page 12 and 13: 1 Introduction for integration flow
Page 14 and 15: 1 Introduction violated. We present
Page 16 and 17: 2 Preliminaries and Existing Techni
Page 44 and 45: 3 Fundamentals of Optimizing Integr
Page 58 and 59:
3 Fundamentals of Optimizing Integr
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
4 Vectorizing Integration Flows •
Page 100 and 101:
4 Vectorizing Integration Flows exe
Page 102 and 103:
4 Vectorizing Integration Flows Ove
Page 104 and 105:
4 Vectorizing Integration Flows Alg
Page 106 and 107:
4 Vectorizing Integration Flows two
Page 108 and 109:
4 Vectorizing Integration Flows Inv
Page 110 and 111:
4 Vectorizing Integration Flows (a)
Page 112 and 113:
4 Vectorizing Integration Flows o 2
Page 114 and 115:
4 Vectorizing Integration Flows In
Page 116 and 117:
4 Vectorizing Integration Flows 2.
Page 118 and 119:
4 Vectorizing Integration Flows The
Page 120 and 121:
4 Vectorizing Integration Flows ord
Page 122 and 123:
4 Vectorizing Integration Flows 4.3
Page 124 and 125:
4 Vectorizing Integration Flows P
Page 126 and 127:
4 Vectorizing Integration Flows P
Page 128 and 129:
4 Vectorizing Integration Flows t1:
Page 130 and 131:
4 Vectorizing Integration Flows We
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
4 Vectorizing Integration Flows 4.7
Page 140 and 141:
5 Multi-Flow Optimization cannot be
Page 142 and 143:
5 Multi-Flow Optimization the query
Page 144 and 145:
5 Multi-Flow Optimization The incom
Page 146 and 147:
5 Multi-Flow Optimization example p
Page 148 and 149:
5 Multi-Flow Optimization not allow
Page 150 and 151:
5 Multi-Flow Optimization partition
Page 152 and 153:
5 Multi-Flow Optimization mention i
Page 154 and 155:
5 Multi-Flow Optimization • Case
Page 156 and 157:
5 Multi-Flow Optimization k ′ . F
Page 158 and 159:
5 Multi-Flow Optimization partition
Page 160 and 161:
5 Multi-Flow Optimization the waiti
Page 162 and 163:
5 Multi-Flow Optimization Execution
Page 164 and 165:
5 Multi-Flow Optimization Thus, for
Page 166 and 167:
5 Multi-Flow Optimization Thus, T L
Page 168 and 169:
5 Multi-Flow Optimization • P 5 :
Page 170 and 171:
5 Multi-Flow Optimization decreasin
Page 172 and 173:
5 Multi-Flow Optimization (a) Fixed
Page 174 and 175:
5 Multi-Flow Optimization reached,
Page 176 and 177:
5 Multi-Flow Optimization (2) plan
Page 178 and 179:
6 On-Demand Re-Optimization categor
Page 180 and 181:
6 On-Demand Re-Optimization present
Page 182 and 183:
6 On-Demand Re-Optimization stratum
Page 184 and 185:
6 On-Demand Re-Optimization o 3 o 4
Page 186 and 187:
6 On-Demand Re-Optimization For on-
Page 188 and 189:
6 On-Demand Re-Optimization 6.3.1 O
Page 190 and 191:
6 On-Demand Re-Optimization such th
Page 192 and 193:
6 On-Demand Re-Optimization Join En
Page 194 and 195:
6 On-Demand Re-Optimization f γ((
Page 196 and 197:
6 On-Demand Re-Optimization The res
Page 198 and 199:
6 On-Demand Re-Optimization project
Page 200 and 201:
6 On-Demand Re-Optimization (a) Sel
Page 202 and 203:
6 On-Demand Re-Optimization (a) Loa
Page 204 and 205:
6 On-Demand Re-Optimization ical re
Page 206 and 207:
6 On-Demand Re-Optimization evaluat
Page 208 and 209:
6 On-Demand Re-Optimization 6.6 Sum
Page 210 and 211:
7 Conclusions Existing approaches b
Page 212 and 213:
Bibliography [BBD05a] Shivnath Babu
Page 214 and 215:
Bibliography [BHP + 09b] [BHP + 11]
Page 216 and 217:
Bibliography [CM95] Sophie Cluet an
Page 218 and 219:
Bibliography [GZ08] [HA03] [Haa07]
Page 220 and 221:
Bibliography [IKNG09] [INSS92] [Ioa
Page 222 and 223:
Bibliography [LX09] [LZ05] Rubao Le
Page 224 and 225:
Bibliography [OMG07] OMG. XML Metad
Page 226 and 227:
Bibliography [Sto02] Michael Stoneb
Page 228 and 229:
Bibliography [ZRH04] Yali Zhu, Elke
Page 230 and 231:
List of Figures 3.27 Workload Adapt
Page 233:
List of Tables 2.1 Interaction-Orie
Page 237:
Selbstständigkeitserklärung Hierm
show all

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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?