Welcome to the InfoSci Platform
Primary and Referential Horizontal Partitioning Selection Problems: Concepts, Algorithms and Advisor Tool

Primary and Referential Horizontal Partitioning Selection Problems: Concepts, Algorithms and Advisor Tool

Ladjel Bellatreche, Kamel Boukhalfa, Pascal Richard
Copyright: © 2011 |Pages: 29
ISBN13: 9781609605377|ISBN10: 1609605373|EISBN13: 9781609605384
DOI: 10.4018/978-1-60960-537-7.ch011
Cite Chapter Cite Chapter

MLA

Bellatreche, Ladjel, et al. "Primary and Referential Horizontal Partitioning Selection Problems: Concepts, Algorithms and Advisor Tool." Integrations of Data Warehousing, Data Mining and Database Technologies: Innovative Approaches, edited by David Taniar and Li Chen, IGI Global, 2011, pp. 258-286. https://doi.org/10.4018/978-1-60960-537-7.ch011

APA

Bellatreche, L., Boukhalfa, K., & Richard, P. (2011). Primary and Referential Horizontal Partitioning Selection Problems: Concepts, Algorithms and Advisor Tool. In D. Taniar & L. Chen (Eds.), Integrations of Data Warehousing, Data Mining and Database Technologies: Innovative Approaches (pp. 258-286). IGI Global. https://doi.org/10.4018/978-1-60960-537-7.ch011

Chicago

Bellatreche, Ladjel, Kamel Boukhalfa, and Pascal Richard. "Primary and Referential Horizontal Partitioning Selection Problems: Concepts, Algorithms and Advisor Tool." In Integrations of Data Warehousing, Data Mining and Database Technologies: Innovative Approaches, edited by David Taniar and Li Chen, 258-286. Hershey, PA: IGI Global, 2011. https://doi.org/10.4018/978-1-60960-537-7.ch011

Export Reference

Mendeley
Favorite

Abstract

Horizontal partitioning has evolved significantly in recent years and widely advocated by the academic and industrial communities. Horizontal Partitioning affects positively query performance, database manageability and availability. Two types of horizontal partitioning are supported: primary and referential. Horizontal fragmentation in the context of relational data warehouses is to partition dimension tables by primary fragmentation then fragmenting the fact table by referential fragmentation. This fragmentation can generate a very large number of fragments which may make the maintenance task very complicated. In this paper, we first focus on the evolution of horizontal partitioning in commercial DBMS motivated by decision support applications. Secondly, we give a formalization of the referential fragmentation schema selection problem in the data warehouse and we study its hardness to select an optimal solution. Due to its high complexity, we develop two algorithms: hill climbing and simulated annealing with several variants to select a near optimal partitioning schema. We present ParAdmin, an advisor tool assisting administrators to use primary and referential partitioning during the physical design of their data warehouses. 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 ensure the well use of 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.