From: Incorporating change detection in the monitoring phase of adaptive query processing
For each query we considered all of the possible solutions | ||
Packet processing | Runtime over- | |
cost (seconds) | head (seconds) | |
A-greedy*/ADWIN2 | 69.65 | 0.66 |
A-greedy*/Martingale Test | 69.44 | 0.45 |
A-greedy*/ChangeFinder | 69.59 | 0.25 |
A-greedy*/Meta-algorithm | 72.08 | 0.20 |
A-greedy*/ β-CUSUM | 67.41 | 0.04 |
A-greedy | 81.64 | 0.91 |
For each query we considered the minimum packet processing | ||
cost solution | ||
Packet processing | Runtime over- | |
cost (seconds) | head (seconds) | |
A-greedy*/ADWIN2 | 69.40 | 0.72 |
A-greedy*/Martingale Test | 69.37 | 0.48 |
A-greedy*/ChangeFinder | 69.48 | 0.26 |
A-greedy*/Meta-algorithm | 70.10 | 0.26 |
A-greedy*/ β-CUSUM | 68.26 | 0.07 |
A-greedy | 70.93 | 8.77 |
For each query we considered the maximum packet processing | ||
cost solution | ||
Packet processing | Runtime over- | |
cost (seconds) | head (seconds) | |
A-greedy*/ADWIN2 | 73.95 | 0.56 |
A-greedy*/Martingale Test | 73.49 | 0.44 |
A-greedy*/ChangeFinder | 73.68 | 0.23 |
A-greedy*/Meta-algorithm | 78.61 | 0.06 |
A-greedy*/ β-CUSUM | 70.45 | 0.04 |
A-greedy | 86.64 | 0.18 |