Approximating and Testing k-Histogram Distributions in Sub-linear Time
Summary: Sublinear-time, sample-efficient algorithms that from samples produce a k-interval piecewise-constant approximation minimizing L2 error to an unknown distribution over [n]. Also gives testers distinguishing k-histograms from distributions ε-far in L1 or L2 with improved complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Piotr Indyk
- 2. Reut Levi
- 3. Ronitt Rubinfeld
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,835 | I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making | 2017 | VLDB | 6.7163364e-05 |
| 5,879 | Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms | 2015 | PODS | 5.2908101e-05 |
| 8,979 | High Performance Stream Query Processing With Correlation-Aware Partitioning | 2014 | VLDB | 4.4170433e-05 |
| 11,821 | Are Few Bins Enough: Testing Histogram Distributions | 2016 | PODS | 4.1945683e-05 |
| 13,372 | Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time | 2015 | PODS | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 269 | Fast Incremental Maintenance of Approximate Histograms | 1997 | VLDB | 0.00029656549 |
| 325 | The History of Histograms (abridged) | 2003 | VLDB | 0.00027378328 |
| 326 | Optimal Histograms with Quality Guarantees | 1998 | VLDB | 0.00027358981 |
| 530 | Random Sampling for Histogram Construction: How much is enough? | 1998 | SIGMOD | 0.00020803682 |
| 852 | Dynamic Multidimensional Histograms | 2002 | SIGMOD | 0.00015941524 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 848 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.0001597308 |
| 4,966 | Relative Error Streaming Quantiles | 2021 | PODS | 5.7959749e-05 |
| 126 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00044744986 |
| 5,956 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS | 5.2566971e-05 |
| 996 | Approximating Multi-Dimensional Aggregate Range Queries Over Real Attributes | 2000 | SIGMOD | 0.00014741524 |
| 275 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00029364901 |
| 852 | Dynamic Multidimensional Histograms | 2002 | SIGMOD | 0.00015941524 |
| 3,619 | Fast Algorithms For Hierarchical Range Histogram Construction | 2002 | PODS | 6.9084829e-05 |
| 11,821 | Are Few Bins Enough: Testing Histogram Distributions | 2016 | PODS | 4.1945683e-05 |
| 5,879 | Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms | 2015 | PODS | 5.2908101e-05 |