DBScholar

Back to papers

Efficient Approximate Query Processing with Block Sampling

Summary: B-AQP: an AQP framework that samples at block/page granularity to match page-oriented I/O, drastically reducing data-loading overhead that record-level sampling incurs. Provides a priori error bounds and achieves up to 185× speedup vs. uniform sampling and ~4 orders faster than exact queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
556
Venue
CIDR
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,634 | 27.05%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zhu_cidr25,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '25},
        title = {{Efficient Approximate Query Processing with Block Sampling}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Zhu, Yuxuan and Kang, Daniel},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers