Skip to main content
Springer Nature Link
Log in

Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments

  • Conference paper
  • First Online:
Conceptual Modeling — ER 2001 (ER 2001)

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

Included in the following conference series:

Abstract

Range-aggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an R-tree. It provides efficient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within given query ranges to compute range-aggregate queries. In this paper, we propose a novel index structure for materializing a data cube, called aggregate cubetree. Each record in all internal nodes of an aggregate cubetree stores the aggregate value of all child nodes of it. Therefore, range-aggregate queries on an aggregate cubetree can be processed without visiting child nodes whose parent node is fully included in the query range, by using the aggregate values in the records of each internal node. The aggregate cubetree is superior to the original cubetree because it can execute queries with a smaller number of node accesses, and shows even better performance than the original cubetree as the query range becomes larger.

This work was supported by the Brain Korea 21 Project

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. S. Chaudhuri and U. Dayal, ”An overview of data warehousing and OLAP technology”, ACM SIGMOD Record 26(1), pages 65–74, 1997

    Article  Google Scholar 

  2. R. Kimball, “The Data Warehouse Toolkit”, John Wiley & Sons, 1996

    Google Scholar 

  3. N. Roussopoulos, “Materialized Views and Data Warehouses”, SIGMOD Record, 27(1), pages 21–26, March 1998.

    Article  Google Scholar 

  4. J. Gray, A. Bosworth, A. Layman, and H. Piramish, “Data Cube: A Relational Aggregation Operator Generalizing, Group-By, Crosstab, and Sub-Totals”, Int. Conference on Data Engineering, pages 152–159, 1996

    Google Scholar 

  5. A. Guttman. “R-Trees: A Dynamic Index Structure for Spatial Searching”, In Proceedings of ACM SIGMOD, pages 47–57, 1984

    Google Scholar 

  6. C. Ho, R. Agrawal, N. Megiddo, R. Srikant. “Range Queries in OLAP Data Cubes”, In Proceedings of ACM SIGMOD, pages 73–88, 1997

    Google Scholar 

  7. Nick Roussopoulos, Yannis Kotdis, Mena Roussopoulos, “Cubetree: Organization of and Bulk Incremental Update on the Data Cube”, In Proceedings of ACM SIGMOD, pages 89–99, 1997

    Google Scholar 

  8. Yannis Kotdis, Nick Roussopoulos, “An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees”, In Proceedings of ACM SIGMOD, pages 249–258, 1998

    Google Scholar 

  9. H. Gupta. “Selections of Views to Materialize in a Data Warehouse”, In Proceedings of ICDT, pages 98–112, Delphi, January 1997

    Google Scholar 

  10. I. S. Mumick, D. Quass, and B. S. Mumick. “Maintenance of Data Cubes and Summary Tables in a Warehouse”, In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 100–111, Tucson, Arizona, May 1997.

    Google Scholar 

  11. V. Harinarayan, A. Rajaraman, J. D. Ullman, “Implementing data cubes efficiently”, In Proceedings of the ACM SIGMOD Conference, pages 205–216, 1996

    Google Scholar 

  12. S. Sarawagi, R. Agrawal, A. Gupta, “On the computing the data cube”, Research Report, IBM Almaden Research Center, Sanjose, Ca, 1996

    Google Scholar 

  13. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, “The R∗-tree: an efficient and robust access method for points and rectangles”, In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 322–331, Atlantic City, NJ, May 1990.

    Google Scholar 

  14. S. Agrawal, R. Agrawal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. “On the Computation of Multidimensional Aggregates”, In Proceedings of VLDB, pages 506–521, August 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Seoul National University, Korea

    Seokjin Hong & Sukho Lee

  2. Dept. of Software Science, Sangmyung University, Korea

    Byoungho Song

Authors
  1. Seokjin Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Byoungho Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sukho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ricoh Company, Ltd., Software Research Center, 1-1-17 Koishikawa, Bunkyo-ku, 112-0002, Tokyo, Japan

    Hideko S.Kunii

  2. George Mason University, Center for Secure Information Systems, Mail Stop 4A4, Fairfax, 22030-4444, VA, USA

    Sushil Jajodia

  3. Department of Computer and Information Science, The Norwegian University of Science and Technology, 7491, Trondheim, Norway

    Arne Sølvberg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, S., Song, B., Lee, S. (2001). Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments. In: S.Kunii, H., Jajodia, S., Sølvberg, A. (eds) Conceptual Modeling — ER 2001. ER 2001. Lecture Notes in Computer Science, vol 2224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45581-7_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45581-7_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42866-4

  • Online ISBN: 978-3-540-45581-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics