Distributed Database Design: A Case Study | Zendy

Umut Tosun | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Distributed Database Design: A Case Study

Author(s) -

Umut Tosun

Publication year - 2014

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2014.08.067

Subject(s) - computer science , replication (statistics) , quality of service , integer programming , selection (genetic algorithm) , table (database) , distributed database , projection (relational algebra) , linear programming , database , data mining , mathematical optimization , distributed computing , algorithm , artificial intelligence , computer network , statistics , mathematics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research