By Topic

OLAP query processing for partitioned data warehouses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bellatreche, L. ; Dept. of Comput. Sci., Univ. of Sci. & Technol., Kowloon, Hong Kong ; Karlapalem, K. ; Mohania, M.

On-line analytical processing (OLAP) queries can take hours or even days to execute on very large data warehouses. Therefore, there is a need to employ techniques that can facilitate efficient execution of these queries. The data partitioning concept that has been studied in the context of relational databases aims to reduce query execution time and facilitate the parallel execution of queries. In this paper, we develop a framework for applying the partitioning technique on DW schema (star schema) to reduce the total query execution cost. We develop an analytical cost model for executing a set of OLAP queries on a partitioned star schema. We conduct experiments to evaluate the utility of partitioning in efficiently executing OLAP queries. Finally, we show how partitioning can be used to facilitate parallel execution of OLAP queries

Published in:

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date of Conference: