Heuristic algorithms for fragment allocation in a distributed database system
27h International Symposium on Computer and Information Sciences, ISCIS 2012, Paris, Fransa, 3 - 04 Ekim 2012, ss.401-408, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1007/978-1-4471-4594-3_41
- Basıldığı Şehir: Paris
- Basıldığı Ülke: Fransa
- Sayfa Sayıları: ss.401-408
- Anahtar Kelimeler: Distributed database design, Fragmentation, Heuristics
- TED Üniversitesi Adresli: Evet
Özet
Communication costs caused by remote access and retrieval of table fragments accessed by queries is the main part execution cost of the distributed database queries. Data Allocation algorithms try to minimize this cost by assigning fragments at or near the sites they may be needed. Data Allocation Problem (DAP) is known to be NP-Hard and this makes heuristic algorithms desirable for solving this problem. In this study, we design a model based on Quadratic Assignment Problem (QAP) for the DAP. The QAP is a well-known problem that has been applied to different problems successfully. We develop a set of heuristic algorithms and compare them with each other through experiments and determine the most efficient one for solving the DAP in distributed databases. © 2013 Springer-Verlag London.