By Topic

A Combined Selection of Fragmentation and Allocation Schemes in Parallel 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)

The process of designing a parallel data warehouse has two main steps: (1) fragmentation and (2) allocation of generated fragments at various nodes. Usually, fragmentation and allocation tasks are used iteratively (we first split the warehouse horizontally and then allocate fragments over the nodes). The main drawback of such design approach (called iterative) is that it does not take into account the interdependencies between fragmentation and allocation since the generated fragments are the input of data allocation problem. In this paper, we consider a parallel data warehouse design approach combining data fragmentation and allocation. Its main characteristic is that it decides on the quality of the allocation schema when fragmenting the warehouse. Our approach is validated using computational tests over a variety of parameter values.

Published in:

Database and Expert Systems Application, 2008. DEXA '08. 19th International Workshop on

Date of Conference:

1-5 Sept. 2008