ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries

  • Rolfe R. Schmidt
  • Cyrus Shahabi
Conference paper

DOI: 10.1007/3-540-45876-X_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)
Cite this paper as:
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. (eds) Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Rolfe R. Schmidt
    • 1
  • Cyrus Shahabi
    • 1
  1. 1.University of Southern CaliforniaLos AngelesUSA

Personalised recommendations