Dynamic multidimensional histograms
Authors:
- Nitin ThaperNTNitin Thaper
- Piotr IndykPIPiotr Indyk
Open Access
- 3 June 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 428-439
Abstract
Histograms are a concise and flexible way to construct summary structures for large data sets. They have attracted a lot of attention in database research due to their utility in many areas, including query optimization, and approximate query answering. They are also a basic tool for data visualization and analysis.In this paper, we present a formal study of dynamic multidimensional histogram structures over continuous data streams. At the heart of our proposal is the use of a dynamic summary data structure (vastly different from a histogram) maintaining a succinct approximation of the data distribution of the underlying continuous stream. On demand, an accurate histogram is derived from this dynamic data structure. We propose algorithms for extracting such an accurate histogram and we analyze their behavior and tradeoffs. The proposed algorithms are able to provide approximate guarantees about the quality of the estimation of the histograms they extract.We complement our analytical results with a thorough experimental evaluation using real data sets.Keywords
This publication has 19 references indexed in Scilit:
- Fast, small-space algorithms for approximate histogram maintenance2002
- Continuous queries over data streamsACM SIGMOD Record, 2001
- STHoles2001
- Space-efficient online computation of quantile summaries2001
- Approximating multi-dimensional aggregate range queries over real attributes2000
- Random sampling techniques for space efficient online computation of order statistics of large datasets1999
- Multi-dimensional selectivity estimation using compressed histogram information1999
- Approximate computation of multidimensional aggregates of sparse data using wavelets1999
- Self-tuning histograms1999
- Data cube approximation and histograms via wavelets1998