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 (Massachusetts Institute of Technology)
- 2. Reut Levi (Tel Aviv University)
- 3. Ronitt Rubinfeld (Massachusetts Institute of Technology; Tel Aviv University)
BibTeX Citation
@inproceedings{indyk_pods12,
address = {New York, NY, USA},
series = {{PODS} '12},
title = {{Approximating and Testing k-Histogram Distributions in Sub-linear Time}},
url = {https://dl.acm.org/doi/10.1145/2213556.2213561},
doi = {10.1145/2213556.2213561},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Indyk, Piotr and Levi, Reut and Rubinfeld, Ronitt},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,288 | I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making | 2017 | VLDB | 7.5578177e-05 |
| 5,421 | Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms | 2015 | PODS | 6.2245831e-05 |
| 8,996 | High Performance Stream Query Processing With Correlation-Aware Partitioning | 2014 | VLDB | 5.3357805e-05 |
| 12,024 | Are Few Bins Enough: Testing Histogram Distributions | 2016 | PODS | 5.093636e-05 |
| 13,573 | 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 |
|---|---|---|---|---|
| 235 | Fast Incremental Maintenance of Approximate Histograms | 1997 | VLDB | 0.00023783792 |
| 257 | The History of Histograms (abridged) | 2003 | VLDB | 0.00023154793 |
| 267 | Optimal Histograms with Quality Guarantees | 1998 | VLDB | 0.00022798161 |
| 508 | Random Sampling for Histogram Construction: How much is enough? | 1998 | SIGMOD | 0.00017275873 |
| 723 | Dynamic Multidimensional Histograms | 2002 | SIGMOD | 0.00014620977 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 691 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |
| 2 | 4,472 | Relative Error Streaming Quantiles | 2021 | PODS |
| 3 | 82 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD |
| 4 | 5,599 | A Tight Lower Bound for Comparison-Based Quantile Summaries | 2020 | PODS |
| 5 | 261 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD |
| 6 | 850 | Approximating Multi-Dimensional Aggregate Range Queries Over Real Attributes | 2000 | SIGMOD |
| 7 | 723 | Dynamic Multidimensional Histograms | 2002 | SIGMOD |
| 8 | 4,889 | Fast Algorithms For Hierarchical Range Histogram Construction | 2002 | PODS |
| 9 | 12,024 | Are Few Bins Enough: Testing Histogram Distributions | 2016 | PODS |
| 10 | 5,421 | Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms | 2015 | PODS |