Model for the design of distributed data bases

Thesis/Dissertation · Tue Jan 01 00:00:00 EST 1985

OSTI ID:5652775

Ram, S

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

• Research Organization: Illinois Univ., Urbana (USA)
• OSTI ID: 5652775
• Resource Relation: Other Information: Thesis (Ph. D.)
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
DISTRIBUTED DATA PROCESSING
DATA BASE MANAGEMENT
ALGORITHMS
FORTRAN
MATHEMATICAL MODELS
PROGRAMMING
DATA PROCESSING
MANAGEMENT
MATHEMATICAL LOGIC
PROCESSING
PROGRAMMING LANGUAGES
990300* - Information Handling
990200 - Mathematics & Computers