















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The concept of proactive re-optimization, an approach to query processing that uses three core techniques to improve performance and prevent re-optimizations. Bounding boxes, optimal, robust, and switchable plans, and experiments with traditional and validity-ranges optimizers. It also explores the prevalence of switchable plans and the impact of rho on re-optimizations.
Typology: Slides
1 / 23
This page cannot be seen from the preview
Don't miss anything!
















0
20
40
60
80
100
120
140
160
180
200
R S T
σ(R) act
! σ(R) est
!^!
Robust Plans
0 50 100 150 200 250 300 350
Switchable
0 50 100 150 200 250 300 350
0
40
80
120
160
200
240
280
320
360
400
440
A C
σ(A) est
0
40
80
120
160
200
240
280
320
360
400
440
A C
σ(A) est σ(A) b. box
Pt |σ1(A)| TRAD VRO Rio Opt
A 6 MB P17a Inside range, P17a Outside box, re-optimize, P17a P17a
B 80 MB P17a Inside range, P17a Inside box, P17a P17a
C 160 MB P17a Outside range, re- optimize, P17d
Inside box, P17d P17b
D 310 MB P17a Outside range, re- optimize, P17d
Outside box, re-optimize, P17b P17b