Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size
Summary: First streaming algorithm that (ε,δ)-approximates |⋃ S_i| for Delphic-family sets (captures Klee’s Measure, test-coverage, hypervolume) with space/update time poly(log|Ω|, ε^{-1}, log δ^{-1}) independent of stream length M. Extends to approximate-Delphic families, resolving two PODS‑21 open problems. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 383 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00024820873 |
| 4,382 | Rectangle-Efficient Aggregation in Spatial Data Streams | 2012 | PODS | 6.2386853e-05 |
| 11,433 | Model Counting meets F0 Estimation | 2021 | PODS | 4.1945683e-05 |
| 11,442 | Estimating the Size of Union of Sets in Streaming Models | 2021 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next