Article

Parallel querying of ROLAP cubes in the presence of hierarchies

Authors:

Andrew Rau-ChaplinAuthors Info & Claims

DOLAP '05: Proceedings of the 8th ACM international workshop on Data warehousing and OLAP

Pages 89 - 96

https://doi.org/10.1145/1097002.1097019

Published: 04 November 2005 Publication History

Abstract

Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimensional data model that offers an intuitive array-based perspective of the underlying data. Supporting efficient indexing facilities for multi-dimensional cube queries is an issue of some complexity. In practice, the difficulty of the indexing problem is exacerbated by the existence of attribute hierarchies that sub-divide attributes into aggregation layers of varying granularity. In this paper, we present a hierarchy and caching framework that supports the efficient and transparent manipulation of attribute hierarchies within a parallel ROLAP environment. Experimental results verify that, when compared to the non-hierarchical case, very little overhead is required to handle streams of arbitrary hierarchical queries.

References

[1]

S. Agarwal, R. Agrawal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. Proceedings of the 22nd International VLDB Conference, pages 506--521, 1996.]]

Digital Library

[2]

K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. Proceedings of the 1999 ACM SIGMOD Conference, pages 359--370, 1999.]]

Digital Library

[3]

Y. Chen, F. Dehne, T. Eavis, and A. Rau-Chaplin. Building large ROLAP data cubes in parallel. International Database Engineering and Applications Symposium, pages 367--377, 2004.]]

Digital Library

[4]

F. Dehne, T. Eavis, S. Hambrusch, and A. Rau-Chaplin. Parallelizing the datacube. International Conference on Database Theory, 2001.]]

Digital Library

[5]

F. Dehne, T. Eavis, and A. Rau-Chaplin. The cgm CUBE project: Optimizing parallel data cube generation for ROLAP. Journal of Parallel and Distributed Databases, 2005. To appear.]]

Digital Library

[6]

P. M. Deshpande, K. Ramasamy, A. Shukla, and J. F. Naughton. Caching multidimensional queries using chunks. SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pages 259--270, 1998.]]

Digital Library

[7]

V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30(2):170--231, 1998.]]

Digital Library

[8]

Goil and A. Choudhary. High performance multidimensional analysis of large datasets. Proceedings of the First ACM International Workshop on Data Warehousing and OLAP, pages 34--39, 1998.]]

Digital Library

[9]

J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Proceeding of the 12th International Conference On Data Engineering, pages 152--159, 1996.]]

Digital Library

[10]

A. Guttman. R-trees: A dynamic index structure for spatial searching. Proceedings of the 1984 ACM SIGMOD Conference, pages 47--57, 1984.]]

Digital Library

[11]

V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing data cubes. Proceedings of the 1996 ACM SIGMOD Conference, pages 205--216, 1996.]]

Digital Library

[12]

I. Kamel and C. Faloutsos. On packing r-trees. Proceedings of the Second International Conference on Information and Knowledge Management, pages 490--499, 1993.]]

Digital Library

[13]

Y. Kotidis and N. Roussopoulos. A case for dynamic view management. ACM Transactions on Database Systems, (4), 2001.]]

Digital Library

[14]

S. Muto and M. Kitsuregawa. A dynamic load balancing strategy for parallel datacube computation. ACM 2nd Annual Workshop on Data Warehousing and OLAP, pages 67--72, 1999.]]

Digital Library

[15]

R. Ng, A. Wagner, and Y. Yin. Iceberg-cube computation with PC clusters. Proceedings of 2001 ACM SIGMOD Conference on Management of Data, pages 25--36, 2001.]]

Digital Library

[16]

K. Ross and D. Srivastava. Fast computation of sparse data cubes. Proceedings of the 23rd VLDB Conference, pages 116--125, 1997.]]

Digital Library

[17]

N. Roussopoulos, Y. Kotidis, and M. Roussopolis. Cubetree: Organization of the bulk incremental updates on the data cube. Proceedings of the 1997 ACM SIGMOD Conference, pages 89--99, 1997.]]

Digital Library

[18]

S. Sarawagi. Indexing OLAP data. Data Engineering Bulletin, 20(1):36--43, 1997.]]

[19]

H. Shi and J. Schaeffer. Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing, 14:361--372, 1990.]]

Digital Library

[20]

A. Shukla, P. Deshpande, J. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presence of hierarchies. Proceedings of the 22nd VLDB Conference, pages 522--531, 1996.]]

Digital Library

[21]

Y. Sismanis, A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Hierarchical dwarfs for the rollup cube. DOLAP 03: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP, pages 17--24, 2003.]]

Digital Library

[22]

Y. Zhao, P. Deshpande, and J. Naughton. An array-based algorithm for simultaneous multi-dimensional aggregates. Proceedings of the 1997 ACM SIGMOD Conference, pages 159--170, 1997.]]

Digital Library

Cited By

Lee SKang SKim JYu E(2018)Scalable distributed data cube computation for large-scale multidimensional data analysis on a Spark clusterCluster Computing10.1007/s10586-018-1811-1Online publication date: 1-Feb-2018
https://doi.org/10.1007/s10586-018-1811-1
Taleb AShaikh AEavis TTaleb N(2015)High performance framework for mining association rules from hierarchical data cubesInternational Journal of Business Intelligence and Data Mining10.1504/IJBIDM.2015.07132410:3(233-252)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1504/IJBIDM.2015.071324
Mohamad Bd'Orazio LGruenwald LDarmont JPedersen T(2012)Towards a hybrid row-column database for a cloud-based medical data management systemProceedings of the 1st International Workshop on Cloud Intelligence10.1145/2347673.2347675(1-4)Online publication date: 31-Aug-2012
https://dl.acm.org/doi/10.1145/2347673.2347675
Show More Cited By

Index Terms

Parallel querying of ROLAP cubes in the presence of hierarchies
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data access methods
    2. Information integration
      1. Data warehouses
  2. Information systems applications
    1. Decision support systems
      1. Data warehouses

Recommendations

Hierarchical dwarfs for the rollup cube
DOLAP '03: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP

The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compressed and clustered structure for creating, storing and indexing data cubes. ...
Parallel Multi-Dimensional ROLAP Indexing
CCGRID '03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid

This paper addresses the query performance issuefor Relational OLAP (ROLAP) datacubes. Wepresent a distributed multi-dimensional ROLAP indexingscheme which is practical to implement, requiresonly a small communication volume, and is fullyadapted to ...
Revising aggregation hierarchies in OLAP: a rule-based approach
Special issue: Advances in OLAP

Enhancing multidimensional database models with aggregation hierarchies allows viewing data at different levels of aggregation. Usually, hierarchy instances are represented by means of so-called rollup functions. Rollups between adjacent levels in the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DOLAP '05: Proceedings of the 8th ACM international workshop on Data warehousing and OLAP

November 2005

122 pages

ISBN:1595931627

DOI:10.1145/1097002

General Chair:
Il-Yeol Song
Drexel University
,
Program Chair:
Juan Trujillo
University of Alicante

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM05

Sponsor:

CIKM05: Conference on Information and Knowledge Management

November 4 - 5, 2005

Bremen, Germany

Acceptance Rates

Overall Acceptance Rate 29 of 79 submissions, 37%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
541
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lee SKang SKim JYu E(2018)Scalable distributed data cube computation for large-scale multidimensional data analysis on a Spark clusterCluster Computing10.1007/s10586-018-1811-1Online publication date: 1-Feb-2018
https://doi.org/10.1007/s10586-018-1811-1
Taleb AShaikh AEavis TTaleb N(2015)High performance framework for mining association rules from hierarchical data cubesInternational Journal of Business Intelligence and Data Mining10.1504/IJBIDM.2015.07132410:3(233-252)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1504/IJBIDM.2015.071324
Mohamad Bd'Orazio LGruenwald LDarmont JPedersen T(2012)Towards a hybrid row-column database for a cloud-based medical data management systemProceedings of the 1st International Workshop on Cloud Intelligence10.1145/2347673.2347675(1-4)Online publication date: 31-Aug-2012
https://dl.acm.org/doi/10.1145/2347673.2347675
Cheng PQiuli T(2012)Design and Realization of College Finance OLAP Analyzer Based on MDXProceedings of the 2011 2nd International Congress on Computer Applications and Computational Science10.1007/978-3-642-28314-7_11(81-86)Online publication date: 2012
https://doi.org/10.1007/978-3-642-28314-7_11
Taniar DLeung CRahayu WGoel S(2008)BibliographyHigh‐Performance Parallel Database Processing and Grid Databases10.1002/9780470391365.biblio(511-539)Online publication date: 11-Mar-2008
https://doi.org/10.1002/9780470391365.biblio
Eavis TTaleb ALaender AFalcão AOlsen ØSilva MBaeza-Yates RMcGuinness DOlstad B(2007)MapgraphProceedings of the sixteenth ACM conference on Conference on information and knowledge management10.1145/1321440.1321507(465-474)Online publication date: 6-Nov-2007
https://dl.acm.org/doi/10.1145/1321440.1321507
Trujillo JSong I(2006)A report on the Eighth ACM International Workshop on Data Warehousing and OLAP (DOLAP'05)ACM SIGMOD Record10.1145/1228268.122828035:4(48-50)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1145/1228268.1228280
Mitrpanont JFugkeaw S(2006)Direct Access Versioning for Multidimensional Database Schema CreationProceedings of the Sixth IEEE International Conference on Computer and Information Technology10.1109/CIT.2006.79Online publication date: 20-Sep-2006
https://dl.acm.org/doi/10.1109/CIT.2006.79
Berger SSchrefl M(2006)Analysing multi-dimensional data across autonomous data warehousesProceedings of the 8th international conference on Data Warehousing and Knowledge Discovery10.1007/11823728_12(120-133)Online publication date: 4-Sep-2006
https://dl.acm.org/doi/10.1007/11823728_12

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten