Approximate query processing: What is new and where to go? a survey on approximate query processing

K Li, G Li - Data Science and Engineering, 2018 - Springer
Online analytical processing (OLAP) is a core functionality in database systems. The
performance of OLAP is crucial to make online decisions in many applications. However, it is …

Selectivity estimation for range predicates using lightweight models

A Dutt, C Wang, A Nazi, S Kandula… - Proceedings of the …, 2019 - dl.acm.org
Query optimizers depend on selectivity estimates of query predicates to produce a good
execution plan. When a query contains multiple predicates, today's optimizers use a variety …

Improved selectivity estimation by combining knowledge from sampling and synopses

M Müller, G Moerkotte, O Kolb - Proceedings of the VLDB Endowment, 2018 - dl.acm.org
Estimating selectivities remains a critical task in query processing. Optimizers rely on the
accuracy of selectivities when generating execution plans and, in approximate query …

[PDF][PDF] Every row counts: Combining sketches and sampling for accurate group-by result estimates

M Freitag, T Neumann - ratio, 2019 - cidrdb.org
Database systems heavily rely upon cardinality estimates for finding efficient execution
plans, and estimation errors can easily affect query execution times by large factors. One …

[PDF][PDF] Enhanced Featurization of Queries with Mixed Combinations of Predicates for ML-based Cardinality Estimation.

M Müller, L Woltmann, W Lehner - EDBT, 2023 - openproceedings.org
Background. For some years now, Machine Learning (ML) has been applied to the
cardinality estimation problem [8, 12, 32, 33]. In general, ML means arbitrary function …

Greedygd: Enhanced generalized deduplication for direct analytics in iot

A Hurst, DE Lucani, Q Zhang - IEEE Transactions on Industrial …, 2024 - ieeexplore.ieee.org
The exponential growth of data generated by the Internet of Things presents significant
challenges for data communication, storage, and analytics. Consequently, organizations …

Coopstore: Optimizing precomputed summaries for aggregation

E Gan, P Bailis, M Charikar - Proceedings of the VLDB Endowment, 2020 - dl.acm.org
An emerging class of data systems partition their data and precompute approximate
summaries (ie, sketches and samples) for each segment to reduce query costs. They can …

[PDF][PDF] Estimating filtered group-by queries is hard: Deep learning to the rescue

A Kipf, M Freitag, D Vorona, P Boncz… - … Workshop on Applied …, 2019 - db.in.tum.de
While estimating the result size of a group-by operation on a base table is hard on its own,
the presence of selections makes this problem increasingly difficult to solve. We show that …

Bounded approximate query processing

K Li, Y Zhang, G Li, W Tao, Y Yan - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
OLAP is a core functionality in database systems and the performance is crucial to enable
on-time decisions. However, OLAP queries are rather time consuming, especially on large …

Generalized Measure-Biased Sampling and Priority Sampling

Z Chang, F Li, Y Shen - IEEE Transactions on Knowledge and …, 2023 - ieeexplore.ieee.org
Query with aggregates is one of the most important classes of ad-hoc queries. Since query
response time is critical in many scenarios, small errors are usually tolerable for query …