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.
This research was supported in part by the CONACYT grant No. 26351A and the COSNET grant No. 568.97-P.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
García Hong-Mei, C., Liu Sheng, O.R.: A Semantic Based Methodology for Integrated Computer-Aided Distributed Database Design. In: Proc. 25th Hawaii International Conference on System Sciences, vol. 3, pp. 288–299 (1992)
Ceri, S., Pelagatti, G.: Distributed Databases: Principles & Systems. McGraw-Hill, New York (1984)
Pérez, J., Romero, D., Frausto, J., Pazos, R., Rodríguez, G., Reyes, F.: Dynamic Allocation of Vertical Fragments in Distributed Databases Using the Threshold Accepting Algorithm. In: Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Systems, Las Vegas, pp. 210–213 (1998)
Lin, X., Orlowska, M., Zhan, Y.: On Data Allocation with the Minimum Overall Communication Cost in Distributed Database Design. In: Proc. of ICCI 1993, pp. 539–544 (1988)
Morales, L., Garduño, R., Romero, D.: The Multiple-Minima Problem in Small Peptides Revisited, The threshold Accepting Approach. Journal of Biomolecular Structure & Dynamics 9(5), 951–957 (1992)
Pazos, R.: Evaluation and Design of Integrated Packet Switching and Circuit Switching Computer Networks. Ph.D. dissertation, Computer Science Dept., UCLA, p.236 (december 1983)
Beasley, J.F., Dowsland, K., Glover, F., Laguna, M.: Modern Heuristic Techniques for Combinatorial Problems, p. 320. Colin R. Reeves, New York (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pèrez, J., Pazos, R., Frausto, J., Romero, D., Cruz, L. (2000). Vertical Fragmentation and Allocation in Distributed Databases with Site Capacity Restrictions Using the Threshold Accepting Algorithm. In: Cairó, O., Sucar, L.E., Cantu, F.J. (eds) MICAI 2000: Advances in Artificial Intelligence. MICAI 2000. Lecture Notes in Computer Science(), vol 1793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720076_7
Download citation
DOI: https://doi.org/10.1007/10720076_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67354-5
Online ISBN: 978-3-540-45562-2
eBook Packages: Springer Book Archive