Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments

  • Seokjin Hong
  • Byoungho Song
  • Sukho Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2224)


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.


Leaf Node Internal Node Child Node Query Range Data Cube 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Chaudhuri and U. Dayal, ”An overview of data warehousing and OLAP technology”, ACM SIGMOD Record 26(1), pages 65–74, 1997CrossRefGoogle Scholar
  2. 2.
    R. Kimball, “The Data Warehouse Toolkit”, John Wiley & Sons, 1996Google Scholar
  3. 3.
    N. Roussopoulos, “Materialized Views and Data Warehouses”, SIGMOD Record, 27(1), pages 21–26, March 1998.CrossRefGoogle Scholar
  4. 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, 1996Google Scholar
  5. 5.
    A. Guttman. “R-Trees: A Dynamic Index Structure for Spatial Searching”, In Proceedings of ACM SIGMOD, pages 47–57, 1984Google Scholar
  6. 6.
    C. Ho, R. Agrawal, N. Megiddo, R. Srikant. “Range Queries in OLAP Data Cubes”, In Proceedings of ACM SIGMOD, pages 73–88, 1997Google Scholar
  7. 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, 1997Google Scholar
  8. 8.
    Yannis Kotdis, Nick Roussopoulos, “An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees”, In Proceedings of ACM SIGMOD, pages 249–258, 1998Google Scholar
  9. 9.
    H. Gupta. “Selections of Views to Materialize in a Data Warehouse”, In Proceedings of ICDT, pages 98–112, Delphi, January 1997Google Scholar
  10. 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. 11.
    V. Harinarayan, A. Rajaraman, J. D. Ullman, “Implementing data cubes efficiently”, In Proceedings of the ACM SIGMOD Conference, pages 205–216, 1996Google Scholar
  12. 12.
    S. Sarawagi, R. Agrawal, A. Gupta, “On the computing the data cube”, Research Report, IBM Almaden Research Center, Sanjose, Ca, 1996Google Scholar
  13. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Seokjin Hong
    • 1
  • Byoungho Song
    • 2
  • Sukho Lee
    • 1
  1. 1.School of Electrical Engineering and Computer ScienceSeoul National UniversityKorea
  2. 2.Dept. of Software ScienceSangmyung UniversityKorea

Personalised recommendations