Skip to main content

Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3181))

Included in the following conference series:

Abstract

Approximate range aggregate queries are one of the most frequent and useful kinds of queries for Decision Support Systems (DSS). Traditionally, sampling- based techniques have been proposed to tackle this problem. However, its effectiveness will degrade when the underlying data distribution is skewed. Another approach based on the outlier management can limit the effect of data skew but fails to address other requirements of approximate range aggregate queries, such as error guarantees and query processing efficiency. In this paper, we present a technique that provide approximate answers to range aggregate queries on OLAP data cubes efficiently with theoretical error guarantees. Our basic idea is to build different data structures for outliers and the rest of the data. Experimental results verified the effectiveness of our proposed methods.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnett, V., Lewis, T.: Outiliers in Statistical Data, 3rd edn. John Wiley, Chichester (1994)

    Google Scholar 

  2. Chatfield, C.: The Analysis of Time Series. Chapman and Hall, Boca Raton (1984)

    MATH  Google Scholar 

  3. Chaudhuri, S., Das, G., Datar, M., Motwani, R., Rastogi, R.: Overcoming Limitations of Sampling for Aggregation Queries. In: ICDE (2001)

    Google Scholar 

  4. Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys 30(1), 170–231 (1998)

    Article  Google Scholar 

  5. Gunopulos, D., Kollios, G., Tsotras, V.J., Domenicani, C.: Approximating Multi- Dimensional Aggregate Range Queries over Real Attributes. In: SIGMOD (2000)

    Google Scholar 

  6. Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online Aggregation. In: SIGMOD (1997)

    Google Scholar 

  7. Ho, C.T., Agrawal, R., Megiddo, N., Srikant, R.: Range Queries in OLAP Data Cubes. In: SIGMOD (1997)

    Google Scholar 

  8. Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association 58(301), 13–30 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jagadish, H., Koudas, N., Muthukrishnan, S.: Mining Deviantes in Time Series Databases. In: VLDB (1999)

    Google Scholar 

  10. Knorr, E., Ng, R.T.: Algorithms for Mining Distance-Based Outliers in Large Datasets. In: VLDB (1998)

    Google Scholar 

  11. Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an Analysis of Range Query Performance in Spatial Data Structures. In: PODS (1993)

    Google Scholar 

  12. Piatetsky-Shapiro, G., Connell, C.: Accurate Estimation of the Number of Tuples Satisfying a Condition. In: SIGMOD (1984)

    Google Scholar 

  13. Poosala, V., Ioannidis, Y.E., Haas, P.J., Shekita, E.: Improved Histograms for Selectivity Estimation of Range Predicates. In: SIGMOD (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cuzzocrea, A., Wang, W., Matrangolo, U. (2004). Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30076-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22937-7

  • Online ISBN: 978-3-540-30076-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics