Sciweavers

Share
DPD
2002

Evolutionary Algorithms for Allocating Data in Distributed Database Systems

11 years 8 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to determine an assignment of fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. This is equivalent to minimizing the average query execution time, which is of primary importance in a wide class of distributed conventional as well as multimedia database systems. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. Furthermore, the optimal allocation of database objects highly depends on the query execution strategy employed by a distributed database system, and the given query execution strategy usually assumes an allocation of the fragments. We develop a site-independent fragment dependen...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where DPD
Authors Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok, Siu-Kai So
Comments (0)
books