[英语学习]Wavelet Synopses for General Error Metrics MINOS GAROFALAKIS.pdfVIP

Wavelet Synopses for General Error Metrics MINOS GAROFALAKIS Intel Research Berkeley and AMIT KUMAR Indian Institute of Technology Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate approximate query answers. Conventional wavelet synopses that greedily minimize the overall root-mean-squared (i.e., L2 -norm) error in the data approximation can suffer from impor- tant problems, including severe bias and wide variance in the quality of the data reconstruction, and lack of nontrivial guarantees for individual approximate answers. Thus, probabilistic thresh- olding schemes have been recently proposed as a means of building wavelet synopses that try to probabilistically control maximum approximation-error metrics (e.g., maximum relative error). A key open problem is whether it is possible to design efficient deterministic wavelet- thresholding algorithms for minimizing general, non-L 2 error metrics that are relevant to approxi- mate query processing systems, such as maximum relative or maximum absolute error. Obviously, such algorithms can guarantee better maximum-error wavelet synopses and avoid the pitfalls of probabilistic techniques (e.g., “bad” coin-flip sequences) leading to poor solutions; in addition, they can be used to directly optimize the synopsis construction process for other useful error metrics, such as the mean relative error in data-value reconstruction. In this article, we propose novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of opti- mizing general approximation-error metrics . We first consider the problem of constructing wavelet synopses optimized for maximum error, and introduce an optimal low polynomial-time algorithm for one-dimensional wavelet thresholding—our algorithm is based on a new Dynamic-Program- m