Distributed database design with genetic algorithm and relation clustering heuristic

Date

2010-11-12

Author

Sevinç, Ender
Coşar, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

14
views

0
downloads

We describe a genetic algorithm based heuristic for distributed database (DDB) design, Relation Clustering (RC). Relations in a database are allocated to nodes of a distributed database such that the total cost of executing a set of queries (each with a given frequency) over a time period is minimized. The experimental results are compared with another earlier GA based algorithm which shows about 15% improvement. © 2011 Springer Science+Business Media B.V.

Subject Keywords

Distributed Database Design, Genetic Algorithm, Relation Clustering

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78651542493&origin=inward
https://hdl.handle.net/11511/107059

DOI

https://doi.org/10.1007/978-90-481-9794-1_27

Conference Name

25th International Symposium on Computer and Information Sciences, ISCIS 2010

Collections

Department of Computer Engineering, Conference / Seminar

Citation Formats

E. Sevinç and A. Coşar, “Distributed database design with genetic algorithm and relation clustering heuristic,” London, İngiltere, 2010, vol. 62 LNEE, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78651542493&origin=inward.