Efficient execution of parallel aggregate data cube queries in data warehouse environments

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the increasing emphasis on data warehouse systems, the efficiency of complex analytical queries in such systems has become an important issue. Such queries posed challenging performance problems that initiated the use of parallel database systems and parallel algorithms in data warehouse environments. Many of these have been proposed in recent years but a review of the literature to our knowledge has not revealed any literature describing parallel methods with detailed cost models for aggregate data cube queries in a data warehouse environment. This paper presents a detailed cost model based on parallel methods for aggregate data cube queries. The detailed cost model enables us to study the behaviour and evaluate the performance of the three methods and thus identify the efficient parallel methods for aggregate data cube queries. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Tan, R. B. N., Taniar, D., & Lu, G. (2004). Efficient execution of parallel aggregate data cube queries in data warehouse environments. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 709–716. https://doi.org/10.1007/978-3-540-45080-1_95

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free