Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design [chapter]

Aleksandar Dimovski, Goran Velinov, Dragan Sahpaski
2010 Lecture Notes in Computer Science  
We propose a new method for horizontal partitioning of relations based on predicate abstraction by using a finite set of arbitrary predicates defined over the whole domains of relations. The method is formal and compositional: arbitrary fragments of relations can be partitioned with arbitrary number of predicates. We apply this partitioning to address the problem of finding suitable design for a relational data warehouse modeled using star schemas such that the performance of a given workload
more » ... optimized. We use a genetic algorithm to generate an appropriate solution for this optimization problem. The experimental results confirm effectiveness of our approach.
doi:10.1007/978-3-642-15576-5_14 fatcat:v4eg4tz5ofdchayfq4gu6kizpy