Abstract
Many range aggregate queries can be efficiently derived from a class of fundamental queries: the polynomial range-sums. After demonstrating how any range-sum can be evaluated exactly in the wavelet domain, we introduce a novel pre-aggregation method called ProPolyne to evaluate arbitrary polynomial range-sums progressively. At each step of the computation, ProPolyne makes the best possible wavelet approximation of the submitted query. The result is a data-independent approximate query answering technique which uses data structures that can be maintained efficiently. ProPolyne’s performance as an exact algorithm is comparable to the best known MOLAP techniques. Our experimental results show that this approach of approximating queries rather than compressing data produces consistent and superior approximate results when compared to typical wavelet-based data compression techniques.
This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC) and IIS-0082826, NIH-NLM grant nr. R01-LM07061, DARPA and USAF under agreement nr. F30602-99-1-0524, and unrestricted cash/equipment gifts from Okawa Foundation, Microsoft, NCR and SUN
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. L. Ambite, C. Shahabi, R. R. Schmidt, and A. Philpot. Fast approximate evaluation of OLAP queries for integrated statistical data. In Nat’l Conf. for Digital Government Research, Los Angeles, May 2001.
K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In Proc. VLDB, pages 111–122, 2000.
C.-Y. Chan and Y. E. Ionnidis. Hierarchical cubes for range-sum queries. In Proc. VLDB, pages 675–686, 1999.
I. Daubechies. Orthonormal bases of compactly supported wavelets. Comm. Pure and Appl. Math., 41:909–996, 1988.
S. Geffner, D. Agrawal, and A. E. Abbadi. The dynamic data cube. In Proc. EDBT, pages 237–253, 2000.
S. Geffner, D. Agrawal, A. E. Abbadi, and T. Smith. Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. In Proc. ICDE, pages 328–335, 1999.
A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Optimal and approximate computation of summary statistics for range aggregates. In Proc. ACM PODS, pages 228–237, 2001.
A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proc. VLDB, 2001.
D. Gunopulos, G. Kollios, V. J. Tsotras, and C. Domeniconi. Approximating multidimensional aggregate range queries over real attributes. In Proc. ACM SIGMOD, pages 463–474, 2000.
J. M. Hellerstein, P. J. Haas, and H. Wang. Online aggregation. In Proc. ACM SIGMOD, pages 171–182, 1997.
C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In Proc. ACM SIGMOD, pages 73–88, 1997.
I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In Proc. ACM SIGMOD, pages 401–412, 2001.
V. Poosala and V. Ganti. Fast approximate answers to aggregate queries on a data cube. In Proc. SSDBM, pages 24–33, 1999.
W. Press, S. Teukolsky, W. Vetterling, and B. Flannery. Numerical Recipes in C. Cambridge Univ. Press, 1992.
M. Riedewald, D. Agrawal, and A. E. Abbadi. pCube: Update-efficient online aggregation with progressive feedback. In Proc. SSDBM, pages 95–108, 2000.
M. Riedewald, D. Agrawal, and A. E. Abbadi. Space-efficient datacubes for dynamic environments. In Proc. of Conf. on Data Warehousing and Knowledge Discovery (DaWaK), pages 24–33, 2000.
M. Riedewald, D. Agrawal, and A. E. Abbadi. Flexible data cubes for online aggregation. In Proc. ICDT, pages 159–173, 2001.
R. R. Schmidt and C. Shahabi. Propolyne: A fast wavelet-based technique for progressive evaluation of polynomial range-sum queries, 2001. USC Tech. Report, available at http://infolab.usc.edu/publication.html.
R. R. Schmidt and C. Shahabi. Wavelet based density estimators for modeling OLAP data sets. In SIAM Workshop on Mining Scientific Datasets, Chicago, April 2001. Available at http://infolab.usc.edu/publication.html.
J. Shanmugasundaram, U. Fayyad, and P. Bradley. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions. In Proc. SIGKDD, August 1999.
S.-C. Shao. Multivariate and multidimensional OLAP. In Proc. EDBT, pages 120–134, 1998.
J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In Proc. ACM SIGMOD, pages 193–204, 1999.
M. V. Wickerhauser. Adapted Wavelet Analysis: From Theory to Software. IEEE Press, 1994.
Y.-L. Wu, D. Agrawal, and A. E. Abbadi. Using wavelet decomposition to support progressive and approximate range-sum queries over data cubes. In Proc. CIKM, pages 414–421, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, R.R., Shahabi, C. (2002). ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries. In: Jensen, C.S., et al. Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45876-X_41
Download citation
DOI: https://doi.org/10.1007/3-540-45876-X_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43324-8
Online ISBN: 978-3-540-45876-0
eBook Packages: Springer Book Archive