Paper Info
Title
Vertical Fragmentation and Allocation in Distributed Databases with Site Capacity Restrictions Using the Threshold Accepting Algorithm
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.
Year
DOI
Venue
2000
10.1007/10720076_7
MICAI
Keywords
Field
DocType
distributed database design.,vertical fragmentation,threshold accepting algorithm,heuristic optimization,site capacity,simulated annealing,distributed database
Simulated annealing,Information system,Mathematical optimization,Heuristic,Computer science,Algorithm,Fragmentation (computing),Combinatorial optimization,Test case,Distributed database,Adaptive algorithm
Conference
Volume
ISSN
ISBN
1793
0302-9743
3-540-67354-7
Citations 
PageRank 
References 
10
0.76
2
Authors
5
Name
Order
Citations
PageRank
Joaquín Pérez1459.56
Rodolfo Pazos2192.16
Juan Frausto Solís33912.02
David Romero4223.65
Laura Cruz58928.40