Wavelet Synopses with Error Guarantees误差保证小波概要.pptVIP

Wavelet Synopses with Error Guarantees Outline Preliminaries Motivation Approximate query processing Haar wavelet decomposition, conventional wavelet synopses The problem Our Solution: Probabilistic Wavelet Synopses The general approach Algorithms for Tuning our Probabilistic Synopses Maximum relative error Relative bias Extensions to Multi-dimensional Haar Wavelets Experimental Study Results with synthetic real-life data sets Conclusions Approximate Query Processing Exact answers NOT always required DSS applications usually exploratory: early feedback to help identify “interesting” regions Aggregate queries: precision to “last decimal” not needed e.g., “What percentage of the US sales are in NJ?” Construct effective data synopses ?? Haar Wavelet Decomposition Wavelets: mathematical tool for hierarchical decomposition of functions/signals Haar wavelets: simplest wavelet basis, easy to understand and implement Recursive pairwise averaging and differencing at different resolutions Haar Wavelet Coefficients Hierarchical decomposition structure ( a.k.a. Error Tree ) Wavelet Data Synopses Compute Haar wavelet decomposition of D Coefficient thresholding : only B|D| coefficients can be kept B is determined by the available synopsis space Conventional thresholding: Take B largest coefficients in absolute normalized value Normalized Haar basis: divide coefficients at resolution j by All other coefficients are ignored (assumed to be zero) Provably optimal in terms of the overall Sum Squared (L2) Error Unfortunately, this methodology gives no approximation-quality guarantees for Individual reconstructed data values Individual range-sum query results Problems with Conventional Synopses An example data vector and wavelet synopsis (|D|=16, B=8 largest coefficients retained) Our Solution: Probabilistic Wavelet Synopses Novel, probabilistic thresholding scheme for Haar coefficients Ideas based on Randomized Rounding In a nutshell Assign coefficient pr