## Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition

### BibTeX

@MISC{Benmessahel_applinga,

author = {Bilal Benmessahel and Mohamed Touahria},

title = {Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition},

year = {}

}

### OpenURL

### Abstract

Abstract. Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that is NP-hard in most cases. We propose an application and an adaptation of an improved combinatorial particle swarm optimization (ICPSO) algorithm for the vertical fragmentation problem. The original CPSO algorithm [3] suffers from major drawback—redundant encoding. This paper applies an improved version of CPSO that using the restricted growth (RG) string [5] constraint to manipulate the particles so that redundant particles are excluded during the PSO process. The effectiveness and efficiency of the improved CPSO algorithm are illustrated through several database design problems, ranging from 10 attributes/8 transactions to 50 attributes/50 transactions. In all cases, our design solutions match the global optimum solutions.

### Citations

1655 | Particle swarm optimization
- Kennedy, Eberhart
- 1995
(Show Context)
Citation Context ...denoted � � � and �� � , respectively. More details about SEPE, including the formula, can be found in Chakravarthy et al. (1992). 3 Particle swarm optimization PSO introduced by Kennedy and Eberhart =-=[8]-=- is one of the most recent metaheuristics, which is inspired by the swarming behavior of animals and human social behavior. Scientists found that the synchrony of animal’s behavior was shown through m... |

483 | Principles of Distributed Database Systems
- Valduriez
- 1991
(Show Context)
Citation Context ... distributed database systems. Compared to other types of data fragmentation, vertical partition is more complicated than horizontal partition because of the increased number of possible alternatives =-=[1]-=-. Vertical partition algorithms contain two essential parts: the optimization method and the objective function. Ozsu and Valduriez [1] argue that finding the best partition scheme for a relation with... |

64 | Vertical Partitioning in Database Design: A Graphical Algorithm - Navathe, Ra - 1989 |

22 | Simple combinatorial Gray codes constructed by reversing sublists
- Ruskey
- 1993
(Show Context)
Citation Context ...ical fragmentation problem. The original CPSO algorithm [3] suffers from major drawback—redundant encoding. This paper applies an improved version of CPSO that using the restricted growth (RG) string =-=[5]-=- constraint to manipulate the particles so that redundant particles are excluded during the PSO process. The effectiveness and efficiency of the improved CPSO algorithm are illustrated through several... |

11 | A formal approach to the vertical partition problem in distributed database design
- Chakravarthy, Muthuraj, et al.
- 1992
(Show Context)
Citation Context ... solve the vertical partition problem by Jun Du and Al (2006) [2]. The balance of the paper is structured as follows. Section 2 introduce the partition evaluator (PE) developed by Chakravarthy and al =-=[4]-=-; this evaluator will be used as the fitness function for the proposed approach and the two other approaches used in experiments. Section 3 presents the particle swarm optimization with a general brie... |

4 | A genetic Algorithm for Vertical Fragmentation and Access Path Selection - Song, Gorla |

2 |
Barker « Genetic algorithms based approach to database vertical partition
- du, Alhajj, et al.
(Show Context)
Citation Context ...object based GA operators called SGA and another GA based algorithm called Group oriented Restricted Growth String GA GRGS-GA developed to solve the vertical partition problem by Jun Du and Al (2006) =-=[2]-=-. The balance of the paper is structured as follows. Section 2 introduce the partition evaluator (PE) developed by Chakravarthy and al [4]; this evaluator will be used as the fitness function for the ... |

2 |
Rebai: Combinatorial particle swarm optimization (CPSO) for partitional clustering problem
- Jarboui, Cheikh, et al.
(Show Context)
Citation Context ... most cases. We propose an application and an adaptation of an improved combinatorial particle swarm optimization (ICPSO) algorithm for the vertical fragmentation problem. The original CPSO algorithm =-=[3]-=- suffers from major drawback—redundant encoding. This paper applies an improved version of CPSO that using the restricted growth (RG) string [5] constraint to manipulate the particles so that redundan... |