Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Wavelets for computer graphics: theory and applications
Wavelets for computer graphics: theory and applications
Wavelet synopses with error guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Approximate query processing using wavelets
The VLDB Journal — The International Journal on Very Large Data Bases
Spatio-temporal data reduction with deterministic error bounds
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Deterministic wavelet thresholding for maximum-error metrics
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Wavelet synopsis for data streams: minimizing non-euclidean error
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
One-pass wavelet synopses for maximum-error metrics
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Approximation algorithms for wavelet transform coding of data streams
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Wavelet synopses for general error metrics
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Exploiting duality in summarization with deterministic guarantees
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Unrestricted wavelet synopses under maximum error bound
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Building data synopses within a known maximum error bound
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Subquadratic algorithms for workload-aware haar wavelet synopses
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for Wavelet Transform Coding of Data Streams
IEEE Transactions on Information Theory
Support vector machines for histogram-based image classification
IEEE Transactions on Neural Networks
Finding the minimum number of elements with sum above a threshold
Information Sciences: an International Journal
| Hi-index | 0.00 |
Having been extensively used to summarize massive data sets, wavelet synopses can be classified into two types: space-bounded and error-bounded synopses. Although various research efforts have been made for the space-bounded synopses construction, the constructions of error-bounded synopses are yet to be thoroughly studied. The state-of-the-art approaches on error-bounded synopses mainly focus on building one-dimensional wavelet synopses, while efficient algorithms on constructing multidimensional error-bounded wavelet synopses still need to be investigated. In this paper, we propose a first linear approximate algorithm to construct multidimensional error-bounded L *** -synopses. Our algorithm constructs a synopsis that has O (logn ) approximation ratio to the size of the optimal solution. Experiments on two-dimensional array data have been conducted to support the theoretical aspects of our algorithm. Our method can build two-dimensional wavelet synopses in less than 1 second for a large data set up to 1024×1024 data array under given error bounds. The advantages of our algorithm is further demonstrated through other comparisons in terms of synopses construction time and synopses sizes.