Abstract
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without scanning or sampling the underlaying datasets in a systematic and comprehensive way. Dynamic histograms allocate more buckets not only for the areas with most skewed data distribution but also according to users' interest. However,it takes long time to 'warm-up' (i.e., a large number of queries need to be processed before the histogram can provide a satisfactory coverage and accuracy). Thus, it is less e®ective to adapt with workload pattern changes. In this paper, we propose a novel online query scheduling algorithm which can signīcantly reduce the warm-up time for dynamic histograms. A parametric method is proposed to remedy the problem of inaccurate query selectivity estimation for the areas with poor histogram coverage. Experimental results demonstrate a signīcant e®ectiveness and accuracy improvement of our approach.
| Original language | English |
|---|---|
| Pages (from-to) | 93-102 |
| Number of pages | 10 |
| Journal | Conferences in Research and Practice in Information Technology Series |
| Volume | 63 |
| State | Published - 2007 |
| Event | 18th Australasian Database Conference, ADC 2007 - Ballarat, VIC, Australia Duration: 30 Jan 2007 → 2 Feb 2007 |
Fingerprint
Dive into the research topics of 'Selectivity estimation by batch-query based histogram and parametric method'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver