Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/23292
Title: | Horizontal partitioning by predicate abstraction and its application to data warehouse design | Authors: | Dimovski, Aleksandar Velinov, Goran Sahpaski, Dragan |
Keywords: | Data Warehouse, Horizontal Partitioning, Predicate Abstraction | Issue Date: | 20-Sep-2010 | Publisher: | Springer, Berlin, Heidelberg | Conference: | East European Conference on Advances in Databases and Information Systems | Abstract: | 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 is optimized. We use a genetic algorithm to generate an appropriate solution for this optimization problem. The experimental results confirm effectiveness of our approach. | URI: | http://hdl.handle.net/20.500.12188/23292 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
adbis10.pdf | 203.08 kB | Adobe PDF | View/Open |
Page view(s)
32
checked on Oct 11, 2024
Download(s)
11
checked on Oct 11, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.