Demonstration of ScroogeDB: Getting More Bang For the Buck with Deterministic Approximation in the Cloud
Summary: Demo of ScroogeDB for deterministic approximate query processing with 100% bounds on aggregation results to cut pay-by-byte cloud costs. On-the-fly synopsis generation interleaves with execution, rewriting queries on compact synopses; demonstrated on BigQuery with a GUI for bounds. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Saehan Jo
- 2. Jialing Pei
- 3. Immanuel Trummer
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 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,616 | DAQ: A New Paradigm for Approximate Query Processing | 2015 | VLDB | 8.4471955e-05 |
| 3,798 | Plato: Approximate Analytics over Compressed Time Series with Tight Deterministic Error Guarantees | 2020 | VLDB | 6.7592302e-05 |
| 11,552 | BitGourmet: Deterministic Approximation via Optimized Bit Selection | 2020 | CIDR | 4.1945683e-05 |
Previous
Page 1 / 1
Next