{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/70459"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/70459","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Ram, Sudha"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Business Administration","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T23:30:27Z","date_published":"2014-12-15T23:30:27Z","updated_at":"2026-07-22T22:26:02Z","subjects":["Business Administration, Management"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8600289"],"render_values":[{"text":"(UMI)AAI8600289","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/70459","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Ram, Sudha"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T23:30:27Z","10000-01-01","1985"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Business Administration"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Business Administration, Management"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/70459","(UMI)AAI8600289"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2014-12-15T23:30:27Z (GMT). No. of bitstreams: 1 8600289.pdf: 4664309 bytes, checksum: 4457e6e723f6a9dab2f59fd9c447ca78 (MD5) Previous issue date: 1985","Embargo set by: Seth Robbins for item 70625 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","162 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985."]},{"key":"dc:title","label":"Title","values":["A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)"]}]}],"canonical_facts":{"dc:creator":["Ram, Sudha"],"dc:date":["2014-12-15T23:30:27Z","10000-01-01","1985"],"dc:description":["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.","Made available in DSpace on 2014-12-15T23:30:27Z (GMT). No. of bitstreams: 1 8600289.pdf: 4664309 bytes, checksum: 4457e6e723f6a9dab2f59fd9c447ca78 (MD5) Previous issue date: 1985","Embargo set by: Seth Robbins for item 70625 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","162 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985."],"dc:identifier":["http://hdl.handle.net/2142/70459","(UMI)AAI8600289"],"dc:subject":["Business Administration, Management"],"dc:title":["A Model for the Design of Distributed Databases (Concurrency Control, Update Synchronization, File Allocation)"],"dc:type":["text"],"thesis:degree_discipline":["Business Administration"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:02Z"}