Vertical Fragmentation and Allocation in Distributed Databases with Site Capacity Restrictions Using the Threshold Accepting Algorithm

This paper presents an extension of the DFAR mathematical optimization model, which unifies the fragmentation, allocation and dynamical migration of data in distributed database systems. The extension consists of the addition of a constraint that models the storage capacity of network sites. This aspect is particularly important in large databases, which exceed the capacity of one or more sites. The Threshold Accepting Algorithm is a variation of the heuristic method known as Simulated Annealing, and it is used for solving the DFAR model. The paper includes experimental results obtained for large test cases.

[1]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[2]  Olivia R. Liu Sheng,et al.  A semantics-based methodology for integrated computer-aided distributed database design , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[3]  Maria E. Orlowska,et al.  On data allocation with minimum overall communication costs in distributed database design , 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

[4]  R Garduño-Juárez,et al.  The multiple-minima problem in small peptides revisited. The Threshold Accepting approach. , 1992, Journal of biomolecular structure & dynamics.