A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)
Ram, Sudha
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/70459
Description
Title
A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)
Author(s)
Ram, Sudha
Issue Date
1985
Department of Study
Business Administration
Discipline
Business Administration
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Business Administration, Management
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
