Query size estimation by adaptive sampling
From MaRDI portal
Recommendations
Cited in
(21)- An outliers divide-and-conquers sampling algorithm for approximate aggregation queries
- scientific article; zbMATH DE number 219227 (Why is no real title available?)
- Using histograms to estimate answer sizes for XML queries.
- scientific article; zbMATH DE number 2086297 (Why is no real title available?)
- Perfect \(L_p\) sampling in a data stream
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
- Sequential sampling techniques for algorithmic learning theory
- scientific article; zbMATH DE number 219226 (Why is no real title available?)
- Uniform generation in spatial constraint databases and applications
- Dynamic analysis of the sizes of relations
- A random sampling approach to worst-case design of structures
- Effective query size estimation using neural networks
- SchemaSQL
- Efficient sampling strategies for relational database operations
- Estimating list sizes in partial joins
- DFT techniques for size estimation of database join operations
- scientific article; zbMATH DE number 3943070 (Why is no real title available?)
- Tracking join and self-join sizes in limited storage
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Analysis and application of adaptive sampling
- Algorithms for provisioning queries and analytics
This page was built for publication: Query size estimation by adaptive sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900915)
