ACM Home Page
Please provide us with feedback. Feedback
An alternative storage organization for ROLAP aggregate views based on cubetrees
Full text PdfPdf (1.19 MB)
Source International Conference on Management of Data archive
Proceedings of the 1998 ACM SIGMOD international conference on Management of data table of contents
Seattle, Washington, United States
Pages: 249 - 258  
Year of Publication: 1998
ISBN:0-89791-995-5
Also published in ...
Authors
Yannis Kotidis  Department of Computer Science, University of Maryland
Nick Roussopoulos  Department of Computer Science, Institute of Advanced Computer Studies, University of Maryland
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276304.276327
What is a DOI?

ABSTRACT

The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing with decision support applications. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary tables appropriate subsets of aggregate views which are then engaged in speeding up OLAP queries. However, a straight forward relational storage implementation of materialized ROLAP views is immensely wasteful on storage and incredibly inadequate on query performance and incremental update speed. In this paper we propose the use of Cubetrees, a collection of packed and compressed R-trees, as an alternative storage and index organization for ROLAP views and provide an efficient algorithm for mapping an arbitrary set of OLAP views to a collection of Cubetrees that achieve excellent performance. Compared to a conventional (relational) storage organization of materialized OLAP views, Cubetrees offer at least a 2-1 storage reduction, a 10-1 better OLAP query performance, and a 100-1 faster updates. We compare the two alternative approaches with data generated from the TPC-D benchmark and stored in the Informix Universal Server (IUS). The straight forward implementation materializes the ROLAP views using IUS tables and conventional B-tree indexing. The Cubetree implementation materializes the same ROLAP views using a Cubetree Datablade developed for IUS. The experiments demonstrate that the Cubetree storage organization is superior in storage, query performance and update speed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AAD+96
 
ACT97
ACT Inc. The Cubetree Datablade. August 1997.
 
BPT97
FR89
 
GBLP96
 
GHRU97
GL95
GMS93
 
Gup97
Gut84
HRU96
JMS95
 
Kim96
R. Kimball. The Data Warehouse Toolkit. John Wiley & Sons, 1996.
 
KR97
Y. Kotidis and N. Roussopoulos. A Generalized Framework for Indexing OLAP Aggregates. Technical Report CS-TR-3841, University of Maryland, Oct 1997.
MQM97
OG95
OQ97
RKR97
RL85
Rou82
 
Sar97
S. Sarawagi. Indexing OLAP Data. IEEE Bulletin on Data Engineering, 20(1 ):36-43, March 1997.
Val87
ZDN97

CITED BY  26

Collaborative Colleagues:
Yannis Kotidis: colleagues
Nick Roussopoulos: colleagues