DBScholar

Back to papers

BitGourmet: Deterministic Approximation via Optimized Bit Selection

Summary: BitGourmet deterministically approximates SQL aggregates by storing data as bit-vectors and processing an optimal subset of bit positions to guarantee result bounds. Leverages bit-level cost/error models, a multi-objective optimizer, specialized operators and predictive buffering; reports speedups vs exact processing and tighter errors than sampling. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
383
Venue
CIDR
Year
2020
Pagerank
5.093636e-05
Overall Rank
11,749 | 19.40%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{jo_cidr20,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '20},
        title = {{BitGourmet: Deterministic Approximation via Optimized Bit Selection}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Jo, Saehan and Trummer, Immanuel},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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