Efficient Aggregation Algorithms on Very Large Compressed Data Warehouses

Jianzhong Li, Yingshu Li, Jaideep Srivastava

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed. However, to our knowledge, there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in multidimensional arrays rather than in tables. This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses. These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them. They are applicable to a variety of data compression methods. The algorithms have different performance behavior as a function of dataset parameters, sizes of outputs and main memory availability. The algorithms are described and analyzed with respect to the I/O and CPU costs. A decision procedure to select the most efficient algorithm, given an aggregation request, is also proposed. The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.

Original languageEnglish
Pages (from-to)213-229
Number of pages17
JournalJournal of Computer Science and Technology
Volume15
Issue number3
Publication statusPublished - May 2000
Externally publishedYes

Fingerprint

Data warehouses
Data Warehouse
Aggregation
Agglomeration
Multidimensional Data
Efficient Algorithms
Multidimensional Arrays
Decision Procedures
Data Compression
Relational Database
Tables
Data compression
Availability
Program processors
Output
Costs
Experimental Results
Data storage equipment

Keywords

  • Aggregation
  • Data warehouse
  • OLAP

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Efficient Aggregation Algorithms on Very Large Compressed Data Warehouses. / Li, Jianzhong; Li, Yingshu; Srivastava, Jaideep.

In: Journal of Computer Science and Technology, Vol. 15, No. 3, 05.2000, p. 213-229.

Research output: Contribution to journalArticle

@article{4ba4a08200c94b81820fc07624080e7c,
title = "Efficient Aggregation Algorithms on Very Large Compressed Data Warehouses",
abstract = "Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed. However, to our knowledge, there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in multidimensional arrays rather than in tables. This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses. These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them. They are applicable to a variety of data compression methods. The algorithms have different performance behavior as a function of dataset parameters, sizes of outputs and main memory availability. The algorithms are described and analyzed with respect to the I/O and CPU costs. A decision procedure to select the most efficient algorithm, given an aggregation request, is also proposed. The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.",
keywords = "Aggregation, Data warehouse, OLAP",
author = "Jianzhong Li and Yingshu Li and Jaideep Srivastava",
year = "2000",
month = "5",
language = "English",
volume = "15",
pages = "213--229",
journal = "Journal of Computer Science and Technology",
issn = "1000-9000",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Efficient Aggregation Algorithms on Very Large Compressed Data Warehouses

AU - Li, Jianzhong

AU - Li, Yingshu

AU - Srivastava, Jaideep

PY - 2000/5

Y1 - 2000/5

N2 - Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed. However, to our knowledge, there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in multidimensional arrays rather than in tables. This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses. These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them. They are applicable to a variety of data compression methods. The algorithms have different performance behavior as a function of dataset parameters, sizes of outputs and main memory availability. The algorithms are described and analyzed with respect to the I/O and CPU costs. A decision procedure to select the most efficient algorithm, given an aggregation request, is also proposed. The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.

AB - Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed. However, to our knowledge, there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in multidimensional arrays rather than in tables. This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses. These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them. They are applicable to a variety of data compression methods. The algorithms have different performance behavior as a function of dataset parameters, sizes of outputs and main memory availability. The algorithms are described and analyzed with respect to the I/O and CPU costs. A decision procedure to select the most efficient algorithm, given an aggregation request, is also proposed. The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.

KW - Aggregation

KW - Data warehouse

KW - OLAP

UR - http://www.scopus.com/inward/record.url?scp=0346739135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346739135&partnerID=8YFLogxK

M3 - Article

VL - 15

SP - 213

EP - 229

JO - Journal of Computer Science and Technology

JF - Journal of Computer Science and Technology

SN - 1000-9000

IS - 3

ER -