Database partitioning in a cluster of processors
ACM Transactions on Database Systems (TODS)
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Algorithms and Support for Horizontal Class Partitioning in Object-Oriented Databases
Distributed and Parallel Databases
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Physical database design decision algorithms and concurrent reorganization for parallel database systems
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Materialization of fragmented views in multidimensional databases
Data & Knowledge Engineering
Experimental evidence on partitioning in parallel data warehouses
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Hybrid greedy and genetic algorithms for optimization of relational data warehouses
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Improvement of Data Warehouse Optimization Process by Workflow Gridification
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Dynamic Evolution and Improvement of Data Warehouse Design
BCI '09 Proceedings of the 2009 Fourth Balkan Conference in Informatics
An evolutionary approach to schema partitioning selection in a data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Data-abstraction refinement: a game semantic approach
SAS'05 Proceedings of the 12th international conference on Static Analysis
Materialized view selection as constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Efficient processing of top-k join queries by attribute domain refinement
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
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.