By Topic

Approximate Query Processing Based on Wavelet Transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yun-Bo Xiong ; Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai ; Bing Liu ; Yun-Fa Hu

Approximate query processing has emerged as a cost-effective approach for dealing with the large database system. Recent work has demonstrated the effectiveness of the wavelet transform in reducing large amounts of data to compact set of wavelet coefficients. In this paper, we extend related works about approximate query processing using wavelet. Two algorithms about how to do union and difference operations directly in wavelet domain are presented. Also we propose an algorithm on the direct update of wavelet coefficients when the original database is changed. The experimental results have shown that the accuracy of using wavelet is better than that of random sampling to do union and difference operations. And when the update amount of data is not too much, the direct update of wavelet is almost as good as the optimal selected wavelet synopses

Published in:

Machine Learning and Cybernetics, 2006 International Conference on

Date of Conference:

13-16 Aug. 2006