Welcome to the InfoSci Platform
Reference Hub7
Query Interaction Based Approach for Horizontal Data Partitioning

Query Interaction Based Approach for Horizontal Data Partitioning

Ladjel Bellatreche, Amira Kerkad
Copyright: © 2015 |Volume: 11 |Issue: 2 |Pages: 18
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781466675926|DOI: 10.4018/ijdwm.2015040103
Cite Article Cite Article

MLA

Bellatreche, Ladjel, and Amira Kerkad. "Query Interaction Based Approach for Horizontal Data Partitioning." IJDWM vol.11, no.2 2015: pp.44-61. http://doi.org/10.4018/ijdwm.2015040103

APA

Bellatreche, L. & Kerkad, A. (2015). Query Interaction Based Approach for Horizontal Data Partitioning. International Journal of Data Warehousing and Mining (IJDWM), 11(2), 44-61. http://doi.org/10.4018/ijdwm.2015040103

Chicago

Bellatreche, Ladjel, and Amira Kerkad. "Query Interaction Based Approach for Horizontal Data Partitioning," International Journal of Data Warehousing and Mining (IJDWM) 11, no.2: 44-61. http://doi.org/10.4018/ijdwm.2015040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

With the explosion of data, several applications are designed around analytical aspects, with data warehousing technology at the heart of the construction chain. The exploitation of this data warehouse is usually performed by the use of complex queries involving selections, joins and aggregations. These queries bring the following characteristics: (1) their routinely aspects, (2) their large number, and (3) the high operation sharing between queries. This interaction has been largely identified in the context of multi-query optimization, where graph data structures were proposed to capture it. Also during the physical design, the structures have been used to select redundant optimization structures such as materialized views and indexes. Horizontal data partitioning (HDP) is another non-redundant optimization structure that can be selected in the physical design phase. It is a pre-condition for designing extremely large databases in several environments: centralized, distributed, parallel and cloud. It aims to reduce the cost of the above operations. In HDP, the optimization space of potential candidates for partitioning grows exponentially with the problem size making the problem NP-hard. This paper proposes a new approach based on query interactions to select a partitioning schema of a data warehouse in a divide and conquer manner to achieve an improved trade-off between the optimization algorithm's speed and the quality of the solution. The effectiveness of our approach is proven through a validation using the Star Schema Benchmark (100 GB) on Oracle11g.

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.