Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellman, R. (1961). Adaptive control processes: A guided tour. Princeton, New Jersey: Princeton University Press.
Chakravarthy, S., Muthuraj, J., Varadarjan, R., & Navathe, S. B. (1992). A formal approach to the vertical partition problem in distributed database design. Technical Report, CIS Department, University of Florida, Gainesville, Florida.
Chu, W. W., & Ieong, I. T. (1992). A transaction-based approach to vertical partition for relational database systems. IEEE Transactions on Software Engineering, 19(8), 804–812.
Cornell, D. W., & Yu, P. S. (1990). An effective approach to vertical partition for physical design of relational database. IEEE Transactions on Software Engineering, 16(2), 248–258.
Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5–30.
Falkenauer, E. (1998). Genetic algorithms and grouping problems. England: Johm Wiley & Sons.
Hammer, M., & Niamir, B. (1979). A heuristic approach to attribute partition. Proceedings of ACM-SIGMOD, pp. 93–100.
Hoffer, J. A., & Severance, D. G. (1975). The use of cluster analysis in physical database design. Proceedings of the International Conference on Very Large Databases, pp. 69–86.
Holland, J. H. (1975). Adaptation in natural and artificial system. University of Michigan Press.
Hung, C. Y., Sumichrast, R. T., & Brown, E. C. (2003). A grouping genetic algorithm for material cutting plan generation. Computers & Industrial Engineering, 44, 651–672.
Navathe, S. B., & Ra, M. (1989). Vertical partition for database design: A graphical algorithm. ACM SIGMOD Record, 18(2), 440–450.
Navathe, S. B., Ceri, S., Wiederhold, G., & Dou, J. (1984). Vertical partition algorithms for database design. ACM Transactions on Database Systems, 9(4), 680–710.
Navathe, S. B., Karlapalem, K., & Ra, M. (1995). A mixed fragmentation approach for initial distributed database design. Journal of Computers and Software Engineering, 3(4).
Niamir, B. (1978, January). Attribute partition in a self-adaptive relational database system. Technical Report 192, Massachusetts Institute of Technology, Laboratory for Computer Science Cambridge, Massachusetts.
Özsu, M. T., & Valduriez, P. (1999). Principles of distributed database systems. Prentice Hall.
Radcliffe, N. J. (1991). Forma analysis and random respectful recombination. Belew and Booker, pp. 222–229.
Ruskey, F. (1993). Simple combinatorial gray codes constructed by reversing sublists. Algorithms and Computation, Lecture Notes in Computer Science 762, pp.201–208, Berlin Heidelberg New York: Springer.
Smith, D. (1985). Bin packing with adaptive search. In J. J. Grefenstette (Ed), Proceedings of the 1st International Conference on Genetic Algorithms, pp. 202–207.
Song, S., & Gorla, N. (2000). A genetic algorithm for vertical fragmentation and access path selection. The Computer Journal, 43(1), 81–93.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Du, J., Alhajj, R. & Barker, K. Genetic algorithms based approach to database vertical partition. J Intell Inf Syst 26, 167–183 (2006). https://doi.org/10.1007/s10844-006-0242-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10844-006-0242-2