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
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
RGFGA: An Efficient Representation and Crossover for Grouping Genetic Algorithms
Evolutionary Computation
Supporting table partitioning by reference in oracle
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SAGA: a combination of genetic and simulated annealing algorithms for physical data warehouse design
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
A Joint Design Approach of Partitioning and Allocation in Parallel Data Warehouses
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Verification of partitioning and allocation techniques on teradata DBMS
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.00 |
Horizontal data partitioning is a non redundant optimization technique used in designing data warehouses. Most of today's commercial database systems offer native data definition language support for defining horizontal partitions of a table. Two types of horizontal partitioning are available: primary and derived horizontal fragmentations. In the first type, a table is decomposed into a set of fragments based on its own attributes, whereas in the second type, a table is fragmented based on partitioning schemes of other tables. In this paper, we first show hardness to select an optimal partitioning schema of a relational data warehouse. Due to its high complexity, we develop a hill climbing algorithm to select a near optimal solution. Finally, we conduct extensive experimental studies to compare the proposed algorithm with the existing ones using a mathematical cost model. The generated fragmentation schemes by these algorithms are validated on Oracle 10g using data set of APB1 benchmark.