| dc.contributor.author | Tosun, Umut | |
| dc.date.accessioned | 2019-12-11T17:32:04Z | |
| dc.date.available | 2019-12-11T17:32:04Z | |
| dc.date.issued | 2014 | |
| dc.identifier.issn | 1877-0509 | |
| dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S1877050914010321?via%3Dihub | |
| dc.identifier.uri | http://hdl.handle.net/11727/4402 | |
| dc.description.abstract | Data Allocation is an important problem in Distributed Database Design. Generally, evolutionary algorithms are used to determine the assignments of fragments to sites. Data Allocation Algorithms should handle replication, query frequencies, quality of service (QoS), cite capacities, table update costs, selection and projection costs. Most of the algorithms in the literature attack one or few components of the problem. In this paper, we present a case study considering all of these features. The proposed model uses Integer Linear Programming for the formulation of the problem. (C) 2014 The Authors. Published by Elsevier B.V. | en_US |
| dc.language.iso | eng | en_US |
| dc.relation.isversionof | 10.1016/j.procs.2014.08.067 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Distributed Databases | en_US |
| dc.subject | Replication | en_US |
| dc.subject | Data Allocation | en_US |
| dc.title | Distributed Database Design: A Case Study | en_US |
| dc.type | Proceedings Paper | en_US |
| dc.relation.journal | 5TH INTERNATIONAL CONFERENCE ON EMERGING UBIQUITOUS SYSTEMS AND PERVASIVE NETWORKS / THE 4TH INTERNATIONAL CONFERENCE ON CURRENT AND FUTURE TRENDS OF INFORMATION AND COMMUNICATION TECHNOLOGIES IN HEALTHCARE / AFFILIATED WORKSHOPS | en_US |
| dc.identifier.volume | 37 | en_US |
| dc.identifier.startpage | 447 | en_US |
| dc.identifier.endpage | 450 | en_US |
| dc.identifier.wos | 000349985800059 | en_US |
| dc.identifier.scopus | 2-s2.0-84930345600 | en_US |
