Small selectivities matter: Lifting the burden of empty samples
Hertzschuch, Axel
;
Moerkotte, Guido
;
Lehner, Wolfgang
;
May, Norman
;
Wolf, Florian
;
Fricke, Lars
DOI:
|
https://doi.org/10.1145/3448016.3452805
|
URL:
|
https://dl.acm.org/doi/10.1145/3448016.3452805
|
Weitere URL:
|
https://www.researchgate.net/publication/352535983...
|
Dokumenttyp:
|
Konferenzveröffentlichung
|
Erscheinungsjahr:
|
2021
|
Buchtitel:
|
Proceedings of the 2021 International Conference on Management of Data : SIGMOD/PODS '21
|
Seitenbereich:
|
697-709
|
Veranstaltungstitel:
|
SIGMOD/PODS '21
|
Veranstaltungsort:
|
Online
|
Veranstaltungsdatum:
|
20.-25.06.2021
|
Herausgeber:
|
Li, Guoliang
;
Li, Zhanhuai
|
Ort der Veröffentlichung:
|
New York, NY
|
Verlag:
|
Association for Computing Machinery
|
ISBN:
|
978-1-4503-8343-1
|
Verwandte URLs:
|
|
Sprache der Veröffentlichung:
|
Englisch
|
Einrichtung:
|
Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik > Practical Computer Science III (Moerkotte 1996-)
|
Fachgebiet:
|
004 Informatik
|
Abstract:
|
Every year more and more advanced approaches to cardinality estimation are published, using learned models or other data and workload specific synopses. In contrast, the majority of commercial in-memory systems still relies on sampling. It is arguably the most general and easiest estimator to implement. While most methods do not seem to improve much over sampling-based estimators in the presence of non-selective queries, sampling struggles with highly selective queries due to limitations of the sample size. Especially in situations where no sample tuple qualifies, optimizers fall back to basic heuristics that ignore attribute correlations and lead to large estimation errors. In this work, we present a novel approach, dealing with these 0-Tuple Situations. It is ready to use in any DBMS capable of sampling, showing a negligible impact on optimization time. Our experiments on real world and synthetic data sets demonstrate up to two orders of magnitude reduced estimation errors. Enumerating single filter predicates according to our estimates reveals 1.3 to 1.8 times faster query responses for complex filters.
|
| Dieser Eintrag ist Teil der Universitätsbibliographie. |
Suche Autoren in
BASE:
Hertzschuch, Axel
;
Moerkotte, Guido
;
Lehner, Wolfgang
;
May, Norman
;
Wolf, Florian
;
Fricke, Lars
Google Scholar:
Hertzschuch, Axel
;
Moerkotte, Guido
;
Lehner, Wolfgang
;
May, Norman
;
Wolf, Florian
;
Fricke, Lars
Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail
Actions (login required)
|
Eintrag anzeigen |
|
|