ABSTRACT
(MATH) A vector A of length N is defined implicitly, via a stream of updates of the form "add 5 to A3." We give a sketching algorithm, that constructs a small sketch from the stream of updates, and a reconstruction algorithm, that produces a B-bucket piecewise-constant representation (histogram) H for A from the sketch, such that ||A—H||≤(1+ε)||A—Hopt||, where the error ||A—H|| is either $\ell_1$ (absolute) or $\ell_2$ (root-mean-square) error. The time to process a single update, time to reconstruct the histogram, and size of the sketch are each bounded by poly(B,log(N),log||A,1/ε. Our result is obtained in two steps. First we obtain what we call a robust histogram approximation for A, a histogram such that adding a small number of buckets does not help improve the representation quality significantly. From the robust histogram, we cull a histogram of desired accruacy and B buckets in the second step. This technique also provides similar results for Haar wavelet representations, under $\ell_2$ error. Our results have applications in summarizing data distributions fast and succinctly even in distributed settings.
- A. Aboulnaga, S. Chaudhuri. Self-tuning Histograms: Building Histograms Without Looking at Data. SIGMOD 1999, 181--192. Google ScholarDigital Library
- N. Alon, Y. Matias, M. Szegedy. The Space Complexity of Approximating the Frequency Moments. JCSS 58(1): 137--147 (1999). Google ScholarDigital Library
- J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan. An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999, 501--511. Google ScholarDigital Library
- P. B. Gibbons, Y. Matias. Synopsis Data Structures for Massive Data Sets SODA 1999, 909--910. Google ScholarDigital Library
- P. B. Gibbons, Y. Matias, V. Poosala. Fast Incremental Maintenance of Approximate Histograms. VLDB 1997, 466--475. Google ScholarDigital Library
- A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss. Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001, 79--88. Google ScholarDigital Library
- A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss. QuickSAND: Quick Summary and Analysis of Network Data DIMACS Technical Report 2001-43.Google Scholar
- S. Guha, N. Koudas. Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation. ICDE 2002.Google ScholarCross Ref
- S. Guha, N. Koudas, K. Shim. Data-streams and histograms. STOC 2001, 471--475. Google ScholarDigital Library
- P. Indyk. Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS 2000, 189--197. Google ScholarDigital Library
- H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, T. Suel. Optimal Histograms with Quality Guarantees. VLDB 1998, 275--286. Google ScholarDigital Library
- J.-H. Lee, D.-H. Kim, C.-W. Chung. Multi-dimensional selectivity estimation using compressed histogram information. SIGMOD 1999, 205--214. Google ScholarDigital Library
- Y. Matias, J. S. Vitter, M. Wang. Dynamic Maintenance of Wavelet-Based Histograms. VLDB 2000, 101--110. Google ScholarDigital Library
- M. Naor, O. Reingold. Private communication, March, 1999.Google Scholar
- N. Nisan Pseudorandom Generators for Space-Bounded Computation. STOC 1990, 204--212. Google ScholarDigital Library
- V. Poosala. Histograms for selecitivty estimation. PhD Thesis, U. Wisconsin, Madison. 1997.Google Scholar
- N. Thaper, S. Guha, P. Indyk, N. Koudas. Dynamic Multidimensional Histograms. SIGMOD 2002. Google ScholarDigital Library
Index Terms
- Fast, small-space algorithms for approximate histogram maintenance
Recommendations
A Novel 3-D Color Histogram Equalization Method With Uniform 1-D Gray Scale Histogram
The majority of color histogram equalization methods do not yield uniform histogram in gray scale. After converting a color histogram equalized image into gray scale, the contrast of the converted image is worse than that of an 1-D gray scale histogram ...
Adjustable Contrast Enhancement Using Fast Piecewise Linear Histogram Equalization
ICIGP '20: Proceedings of the 2020 3rd International Conference on Image and Graphics ProcessingHistogram equalization is a technique to enhance the contrast of the image by redistributing the histogram. In this paper, a fast piecewise linear histogram equalization method is introduced based on an adjustable degree of enhancement and piecewise ...
Bi-histogram equalization using modified histogram bins
Display Omitted The proposed BHEMHB improves conventional histogram equalization.Histogram segmentation enables mean brightness preservation.Histogram modification reduces domination effect of high-frequency histogram bins.BHEMHB is tested using ...
Comments