A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)

This research focuses on developing a model to solve the File Allocation Problem (FAP). The model integrates two major design issues namely Concurrency Control and Data Distribution. The central node locking mechanism is incorporated in developing a non linear integer programming model. Two solution algorithms are proposed, one of which has been implemented in FORTRAN V. The allocation of databases and programs has been examined using this heuristic. Several decision rules have also been formulated based on the results of the heuristic. A second more comprehensive heuristic has been proposed based on the knapsack problem. The development and implementation of this algorithm has been left as a topic for future research.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Business Administration

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Ram, Sudha

• Business Administration, Management

Identifier

(UMI)AAI8600289

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/70459