In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have a good energy compaction property and thus can approximate data distribution functions easily with small number of coefficients. The derived estimator is accurate and easy to update. We perform experiments to compare its performance with a well-known technique - the (Haar) wavelet. The experimental results show that the cosine transform performs much better than the wavelet in estimation accuracy, speed, space efficiency, and update easiness. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hou, W. C., Luo, C., Jiang, Z., Yan, F., & Zhu, Q. (2008). Approximate range-sum queries over data cubes using cosine transform. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5181 LNCS, pp. 376–389). https://doi.org/10.1007/978-3-540-85654-2_35
Mendeley helps you to discover research relevant for your work.