Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms

Authors:
Ladjel Bellatreche;Rima Bouchakri;Alfredo Cuzzocrea;Sofian Maabout
Affiliations:
LIAS/ISAE-ENSMA, Poitiers University, Poitiers, France;National High School for Computer Science, Algiers, Algeria;ICAR-CNR and University of Calabria, Rende, Italy;LABRI, Bordeaux, France
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 4
Cited 0

Why decision support fails and how to fix it

ACM SIGMOD Record
Optimal redesign policies to support dynamic processing of applications on a distributed relational database system

Information Systems
A Framework for Class Partitioning in Object-Oriented Databases

Distributed and Parallel Databases
Integrating vertical and horizontal partitioning into automated physical database design

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the explosion of the size of data warehousing applications, the horizontal data partitioning is well adapted to reduce the cost of complex OLAP queries and the warehouse manageability. It is considered as a non redundant optimization technique. Selecting a fragmentation schema for a given data warehouse is NP-hard problem. Several studies exist and propose heuristics to select near optimal solutions. Most of these heuristics are static, since they assume the existence of a priori known set of queries. Note that in real life applications, queries may change dynamically and fragmentation heuristics need to integrate these changes. In this paper, we propose an incremental selection of fragmentation schemes using on genetic algorithms. Intensive experiments are conducted to validate our proposal.