Welcome to the InfoSci Platform
Reference Hub21
Referential Horizontal Partitioning Selection Problem in Data Warehouses: Hardness Study and Selection Algorithms

Referential Horizontal Partitioning Selection Problem in Data Warehouses: Hardness Study and Selection Algorithms

Ladjel Bellatreche, Kamel Boukhalfa, Pascal Richard, Komla Yamavo Woameno
Copyright: © 2009 |Volume: 5 |Issue: 4 |Pages: 23
ISSN: 1548-3924|EISSN: 1548-3932|ISSN: 1548-3924|EISBN13: 9781616920425|EISSN: 1548-3924|DOI: 10.4018/jdwm.2009080701
Cite Article Cite Article

MLA

Bellatreche, Ladjel, et al. "Referential Horizontal Partitioning Selection Problem in Data Warehouses: Hardness Study and Selection Algorithms." IJDWM vol.5, no.4 2009: pp.1-23. http://doi.org/10.4018/jdwm.2009080701

APA

Bellatreche, L., Boukhalfa, K., Richard, P., & Woameno, K. Y. (2009). Referential Horizontal Partitioning Selection Problem in Data Warehouses: Hardness Study and Selection Algorithms. International Journal of Data Warehousing and Mining (IJDWM), 5(4), 1-23. http://doi.org/10.4018/jdwm.2009080701

Chicago

Bellatreche, Ladjel, et al. "Referential Horizontal Partitioning Selection Problem in Data Warehouses: Hardness Study and Selection Algorithms," International Journal of Data Warehousing and Mining (IJDWM) 5, no.4: 1-23. http://doi.org/10.4018/jdwm.2009080701

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Horizontal Partitioning has been largely adopted by the database community, where it took a significant part in the physical design process. Actually, it is supported by most commercial database systems (DBMS), where a native Data Definition Language for decomposing tables/materialized views using various modes is proposed. In traditional databases, horizontal partitioning has been largely studied, where several fragmentation algorithms were proposed to partition tables in isolation. In the relational data warehouse environment, horizontal partitioning consists in decomposing the whole warehouse schema into sub schemas, where each schema contains fragments of dimension and fact tables. Dimension tables are fragmented using the primary partitioning mode, whereas the fact table is divided using referential mode. In this article, the authors first focus on the evolution of horizontal partitioning in commercial DBMS motivated by decision support applications. Secondly, they give a formalization of the referential fragmentation schema selection problem in the data warehouse and they study its hardness to select an optimal solution. Due to its high complexity, they develop two algorithms: hill climbing and simulated annealing with several variants to select a near optimal partitioning schema. Finally, extensive experimental studies are conducted using the data set of APB1 benchmark to compare the quality the proposed algorithms using a mathematical cost model. Based on these experiments, some recommendations are given to advise database administrator for well using horizontal partitioning.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.