A genetic algorithm-based clustering approach for database partitioning

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 32, Issue 3, 2002, Pages 215-230

  Cheng, Chun Hung ^a   Lee, Wing Kin ^b   Wong, Kam Fai ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b Bank Of China   (China)

Author keywords

Clustering; Data partitioning; Genetic algorithm (GA); Optimization

Indexed keywords

DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; GENETIC ALGORITHMS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

DATA PARTITIONING;

DATABASE SYSTEMS;

EID: 0036704857     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2002.804444     Document Type: Article

References (48)

1. M. Abdelguerfi and K.F. Wong, Parallel Database Techniques. Piscataway, NJ: IEEE Press, 1998.
2. D. Beasley, D.R. Bull, and R.R. Martin, "An overview of genetic algorithms: Part 1, fundamentals," Univ. Comput., vol. 15, pp. 58-69, 1993.
3. S. Ceri and G. Pelagate, Distributed Databases: Principle and Systems. New York: McGraw-Hill, 1984.
4. C.H. Cheng, "A branch and bound clustering algorithm," IEEE Trans. Syst., Man, Cybern., vol. 25, pp. 895-898, 1995.
5. "New genetic algorithm crossover operators for TSP," Tech. Rep., Dept. Syst. Eng. Eng. Manage., Chinese Univ. Hong Kong, Shatin, N.T.
6. D.W. Cornell and P.S. Yu, "A vertical partitioning algorithm for relational databases," in Proc. 3rd Int. Conf. Data Engineering, 1987, pp. 30-35.
7. _, "An effective approach to vertical partitioning for physical design of relational databases," IEEE Trans. Software Eng., vol. 16, pp. 248-258, 1990.
8. C.J. Date, An Introduction to Database Systems, 6th ed. Reading, MA: Addison-Wesley, 1995.
9. L. Davis, "Applying adaptive algorithms to epistatic domains," in Proc. Int. Joint Conf. Artificial Intelligence, 1985, pp. 162-164.
10. E.W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
11. M.J. Eisner and D.G. Severance, "Mathematical techniques for efficient record segmentation in large shared databases," J. Assoc. Comput. Mach., vol. 23, pp. 619-635, 1976.
12. E. Falkenauer, Genetic Algorithms and Grouping Problems. New York: Wiley, 1998.
13. F. Glover, "Tabu search-Part I," ORSA J. Comput., vol. 1, pp. 190-206, 1989.
14. _, "Tabu search-Part II," ORSA J. Comput., vol. 2, pp. 4-32, 1990.
15. D.E. Goldberg and R. Lingle, "Alleles, loci, and the traveling salesman problem," in Proc. Ist Int. Conf. Genetic Algorithms and Their Applications, 1985, pp. 154-159.
16. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Ma-chine Learning. Reading, MA: Addison-Wesley, 1989.
17. M. Hammer and B. Niamir, "A heuristic approach to attribute partitioning," in Proc. ACM SIGMOD Int. Conf Management of Data, 1979, pp. 93-101.
18. R.L. Haupt and S.E. Haupt, Practical Genetic Algorithms. New York: Wiley, 1998.
19. A. Hertz and D. de Werra, "Using tabu search techniques for graph coloring," Computing, vol. 29, pp. 345-351, 1987.
20. J.A. Hoffer, "An integer programming formulation of computer database design problems," Inf. Sci., vol. 11, pp. 29-48, 1976.
21. J.H. Holland, Adaptation in Natural and Artificial Systems, ser. MI. Ann Arbor: Michigan Univ. Press, 1975.
22. L.J. Hubert and J. Schultz, "Quadratic assignment as a general data-analysis strategy," Br. J. Math. Stat. Psychol., vol. 29, pp. 190-241, 1976.
23. Y.F. Huang and C.H. Van, "Vertical partitioning in database design," Inf. Sci., vol. 86, pp. 19-35, 1995.
24. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
25. E.L. Lawler and D.E. Wood, "A branch-and-bound method: A survey," Open Res., vol. 14, pp. 699-719, 1966.
26. J.K. Lenstra and A.H.G. Kan Rinnooy, "Some simple applications of the traveling salesman problem," Oper. Res. Q., vol. 26, pp. 717-733, 1975.
27. S. Lin and B.W. Kernighan, "An effective heuristic algorithm for traveling salesman problem," Open. Res., vol. 21, pp. 498-516, 1973.
28. X. Lin and Y. Zhang, "A new graphical method for vertical partitioning in distributed database design," in Proc. 4th Australian Database Conf., 1993, pp. 131-144.
29. W.T. McCormick and P.J. Schwietzer, "Problem decomposition and data reorganization by a clustering technique," Oper. Res., vol. 20, pp. 993-1009, 1972.
30. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. New York: Springer-Verlag, 1999.
31. P. Miliotis, "Integer programming approaches to the traveling salesman problem," Math. Program., vol. 10, pp. 367-378, 1976.
32. S. Navathe, S. Ceri, G. Wiederhold, and J. Dou, "Vertical partitioning algorithm for database design," ACM Trans. Database Syst., vol. 9, pp. 680-710, 1984.
33. S. Navathe and M. Ra, "Vertical partitioning for database design: A graphical algorithm," Proc. ACM SIGMOD, pp. 440-459, 1989.
34. I.M. Oliver, D.J. Smith, and J.R.C. Holland, "A study of permutation crossover operators on the traveling salesman problem," in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 224-230.
35. M. Ozsu and P. Valduriez, Principles of Distributed Database Systems. Englewood Cliffs, NJ: Prentice-Hall, 1991.
36. G. Reinelt, "TSPLIB-A traveling salesman problem library," ORSA J. Comput., vol. 3, pp. 376-384, 1991.
37. E. Rich, Artificial Intelligence. New York: McGraw-Hill, 1983.
38. D. Rosenkrantz, R. Stearns, and P. Lewis, "Approximate algorithms for the traveling salesperson problem," in Proc. 15th Ann. IEEE Symp. Switching and Automata Theory, 1974, pp. 33-42.
39. R.A. Rutenbar, "Simulated annealing algorithm: An overview," IEEE Circuits Devices Mag., pp. 19-26, Jan. 1989.
40. J.R. Slagle, C.L. Chang, and S.R. Heller, "A clustering and data-reorganization algorithm," IEEE Trans. Syst., Man, Cybern., vol. SMC-5, pp. 125-128, 1975.
41. L.E. Stanfel, "Experiments with a very efficient heuristic for clustering problems," Inf. Syst., vol. 4, pp. 285-292, 1979.
42. _, "Application of clustering to information system design," Inf. Process. Manage., vol. 19, pp. 37-50, 1983.
43. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley, "A comparison of genetic sequencing operators," Proc. 4th Int. Conf. Genetic Algorithms and Their Applications, pp. 69-76, 1991.
44. G. Syswerda, "Schedule optimization using genetic algorithms," in Handbook of Genetic Algorithms, L. Davis, Ed. New York: Van Nostrand, 1991, pp. 332-349.
45. D. Whitley, "The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," Proc. 3rd Int. Conf. Genetic Algorithms, pp. 116-121, 1989.
46. D. Whitley, T. Starkweather, and D.A. Fuquay, "Scheduling problems and traveling salesman: The genetic edge recombination operator," Proc. 3rd Int. Conf. Genetic Algorithms, pp. 133-140, 1989.
47. Y. Zhang and M.E. Orlowska, "On fragmentation approaches for distributed database design," Inf. Syst., vol. 1, pp. 117-132, 1994.
48. S. Zhou, H.M. Williams, and K.F. Wong, "Data placement in shared-nothing database systems," High Performance Cluster Computing, vol. 2, pp. 440-453, 1999.