Skip to main content
Log in

An efficient multidimensional \(L_{\infty }\) wavelet method and its application to approximate query processing

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Approximate query processing (AQP) has been an effective approach for real-time and online query processing for today’s query systems. It provides approximate but fast query results to users. In wavelet based AQP, queries are executed against the wavelet synopsis which is a lossy, compressed representation of the original data returned by a specific wavelet method. Wavelet synopsis optimized for \(L_{\infty }\)-norm error can guarantee approximate error of each individual element, thus it can provide error guaranteed query results for many queries. However, most algorithms for building one dimensional \(L_{\infty }\) synopsis are of super linear complexity, which makes the extension to their multidimensional case challengeable. In this paper, we propose an efficient multidimensional wavelet method towards constructing \(L_{\infty }\) synopsis and we apply it to AQP. The proposed wavelet method can bound the approximate error of each individual element and it has linear time complexity. It can also provide fast AQP. These good properties are all verified theoretically. Extensive experiments on both synthetic and real-life datasets are presented to show its effectiveness and efficiency for data compression and AQP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algor. 12(2), 1–19 (2016)

    Article  MathSciNet  Google Scholar 

  2. Cormode, G., Garofalakis, M., Haas, P.J., Jermaine, C.: Synopses for massive data: samples, histograms, wavelets, sketches. Foundations and Trends in Databases 4(1-3), 1–294 (2012)

    Article  Google Scholar 

  3. Chakrabarti, K., Garofalakis, M., Rastogi, R., Shim, K.: Approximate query processing using wavelets. The VLDB Journal 10(2-3), 199–223 (2001)

    Article  Google Scholar 

  4. Garofalakis, M., Gibbons, P.B.: Wavelet synopses with error guarantees. In: ACM SIGMOD International Conference on Management of Data, pp 476–487 (2002)

  5. Garofalakis, M., Gibbons, P.B.: Probabilistic wavelet synopses. ACM Transactions on Database Systems 29(1), 43–90 (2004)

    Article  Google Scholar 

  6. Garofalakis, M., Kumar, A.: Wavelet synopses for general error metrics. Acm Transactions on Database Systems 30(4), 888–928 (2005)

    Article  Google Scholar 

  7. Guha, S.: Space efficiency in synopsis construction algorithms. In: International Conference on Very Large Data Bases, pp 409–420 (2005)

  8. Guha, S., Harb, B.: Wavelet synopsis for data streams: minimizing non-euclidean error. In: Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp 88–97 (2005)

  9. Guha, S.: On the space-time of optimal, approximate and streaming algorithms for synopsis construction problems. The VLDB Journal 17(6), 1509–1535 (2008)

    Article  Google Scholar 

  10. Guo, X., Zhao, H., Li, X., Li, T., Dai, M.: Eeg signal analysis based on fixed-value shift compression algorithm. In: International Conference on Natural Computation, pp 959–963 (2015)

  11. Han, X., Li, J., Gao, H.: Efficiently processing (p, ε)-approximate join aggregation on massive data. Inform. Sci. 278, 773–792 (2014)

    Article  MathSciNet  Google Scholar 

  12. Jawerth, B., Sweldens, W.: An overview of wavelet based multiresolution analyses. Siam Review 36(3), 377–412 (1994)

    Article  MathSciNet  Google Scholar 

  13. Jiang, Y., Pang, C., Zhang, H.L., Wang, J., Li, T., Zhang, Q., He, J.: Finding the minimum number of elements with sum above a threshold. Inform. Sci. 238(7), 205–211 (2013)

    Article  MathSciNet  Google Scholar 

  14. Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 380–389 (2007)

  15. Karras, P., Mamoulis, N.: One-pass wavelet synopses for maximum-error metrics. In: International Conference on Very Large Data Bases, pp 421–432 (2005)

  16. Liu, J., Yan, D.L.: Answering approximate queries over xml data. IEEE Trans. Fuzzy Syst. 24(2), 288–305 (2016)

    Article  Google Scholar 

  17. Mallat, S.: A Wavelet Tour of Signal Processing. Academic Press (1999)

  18. Matias, Y., Vitter, J.S., Wang, M.: Wavelet-based histograms for selectivity estimation. ACM SIGMOD Record 27(2), 448–459 (1998)

    Article  Google Scholar 

  19. Matias, Y., Vitter, J.S., Wang, M.: Dynamic maintenance of wavelet-based histograms. In: International Conference on Very Large Data Bases, pp 101–110 (2000)

  20. Muthukrishnan, S.: Subquadratic algorithms for workload-aware haar wavelet synopses. In: International Conference on Foundations of Software Technology and Theoretical Computer Science, pp 285–296 (2005)

  21. Pang, C., Zhang, Q., Zhou, X., Hansen, D., Wang, S., Maeder, A.: Computing unrestricted synopses under maximum error bound. Algorithmica 65(1), 1–42 (2013)

    Article  MathSciNet  Google Scholar 

  22. Stollnitz, E.J., Derose, T.D., David, H.: Salesin wavelets for computer graphics: theory and applications (1996)

  23. Pang, C., Zhang, Q., Hansen, D., Maeder, A.: Unrestricted wavelet synopses under maximum error bound. In: International Conference on Extending Database Technology, pp 732–743 (2009)

  24. Vitter, J.S., Wang, M.: Approximate computation of multidimensional aggregates of sparse data using wavelets. Acm Sigmod Record 28(2), 193–204 (1999)

    Article  Google Scholar 

  25. Zhang, Q., Pang, C., Hansen, D.: On multidimensional wavelet synopses for maximum error bounds. In: International Conference on Database Systems for Advanced Applications, pp 646–661 (2009)

  26. Wang, Y., Xia, Y., Fang, Q., Xu, X.: Aqp++: a hybrid approximate query processing framework for generalized aggregation queries. J. Comput. Sci. 26, 419–431 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61572022), the Hebei “One Hundred Plan” Project (No. E2012100006), the Science and Technology Project of Hebei Academy of Sciences (No. 17607), the Science and Technology Project of Hebei Academy of Sciences (No. 20606), the Hebei Science and Technology Development Fund Project guided by the central government (No. 206Z0101G), and the Ningbo eHealth Project (No. 2016C11024).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Xiaoyun Li or Chaoyi Pang.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guo, X., Li, T., Li, X. et al. An efficient multidimensional \(L_{\infty }\) wavelet method and its application to approximate query processing. World Wide Web 24, 105–133 (2021). https://doi.org/10.1007/s11280-020-00834-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-020-00834-7

Keywords

Navigation