Vertical fragmentation and allocation in distributed databases with site capacity restrictions using the threshold accepting algorithm

Authors/Editors

Research Areas

Publication Details

Output type: Other

Author list: Perez J, Pazos R, Frausto J, Romero D, Cruz L, Mutulu M

Publisher: Springer

Publication year: 2000

Volume number: 1793

Start page: 75

End page: 81

Number of pages: 7

ISBN: 3-540-67354-7

ISSN: 0302-9743

Languages: English-Great Britain (EN-GB)

• View in Web of Science
•  | 
• View citing articles in Web of Science

Abstract

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.

Keywords

distributed database design, heuristic optimization

Documents

No matching items found.