Download Now Free registration required
Vertical fragmentation in databases is considered as a difficult problem; it has attracted the interest of many researchers and has been the subject of several studies. In the literature, these studies suggest approaches to solving the problem of vertical fragmentation, these approaches always provide a solution, but the authors find no indication about the relevance of solutions, nor any clue about their qualities. In this paper, they propose an algorithm that seems be best suited to the problem of vertical fragmentation and especially gives a best solution. To validate their approach they compared their solution to two existing algorithms based on two early studies (genetic algorithm & apriori algorithm).
- Format: PDF
- Size: 639.08 KB