Database Allocation in a Distributed Environment: Incorporating a Concurrency Control Mechanism and Queuing Costs

Sudha Ram and Sridhar Narasimhan
Additional contact information
Sudha Ram: Department of Management Information Systems, College of BPA, University of Arizona, Tucson, Arizona 85721
Sridhar Narasimhan: School of Management, Georgia Institute of Technology, Atlanta, Georgia 30332-0520

Management Science, 1994, vol. 40, issue 8, 969-983

Abstract: This research investigates the problem of allocating database fragments across a set of computers connected by a communication network. A mathematical model is presented to aid designers in the development of distributed database systems. The model takes into account the pattern of usage of the databases, communication costs in the network, delays due to queuing of data requests, costs for maintaining consistency among the various copies of a database, and storage costs. A solution procedure based on Lagrangian relaxation is proposed to solve the model. Computational results are reported along with several useful observations. The model is applicable to organizations that are considering migration from a centralized to a distributed computing environment.

Keywords: distribution database systems; concurrency control; file allocation; Lagrangian relaxation; network design (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.40.8.969 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:40:y:1994:i:8:p:969-983

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().