Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
IEEE Transactions on Software Engineering
Bin Packing with Adaptive Search
Proceedings of the 1st International Conference on Genetic Algorithms
Simple Combinatorial Gray Codes Constructed by Reversing Sublists
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
CPGEA: a grouping genetic algorithm for material cutting plan generation
Computers and Industrial Engineering
Genetic algorithm and difference expansion based reversible watermarking for relational databases
Journal of Systems and Software
| Hi-index | 0.00 |
Vertical partition clusters attributes of a relation to generate fragments suitable for subsequent allocation over a distributed platform with the goal of improving performance. Vertical partition is an optimization problem that can resort to genetic algorithms (GA). However, the performance of the classical GA application to vertical partition as well as to similar problems such as clustering and grouping suffers from two major drawbacks--redundant encoding and non-group oriented genetic operations. This paper applies the restricted growth (RG) string Ruskey (1993) constraint to manipulate the chromosomes so that redundant chromosomes are excluded during the GA process. On RG string compliant chromosomes, the group oriented crossover and mutation become realizable. We thus propose a novel approach called Group oriented Restricted Growth String GA (GRGS-GA) which incorporates the two above features. Finally, we compare the proposed approach with a rudimental RG string based approach and a classical GA based approach. The conducted experiments demonstrate a significant improvement of GRGS-GA on partition speed and result, especially for large size vertical partition problems.