An Optimized Vertical Fragmentation Approach

Vertical fragmentation in databases is considered as adifficult problem; it has attracted the interest of many researchersand has been the subject of several studies. In the literature, thesestudies suggest approaches to solving the problem of verticalfragmentation, these approaches always provide a solution, but wefind no indication about the relevance of solutions, nor any clueabout their qualities.In this study we propose an algorithm that seems be best suitedto the problem of vertical fragmentation and especially gives a bestsolution. To validate our approach we compared our solution totwo existing algorithms based on two early studies (Geneticalgorithm & Apriori algorithm).