A model for designing distributed database systems

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

In designing distributed database systems, an important issue is the location of various copies of each database. This is known as the File Allocation Problem (FAP). This paper examines the impact of incorporating a specific concurrency control mechanism (CCM) into the FAP. Several mechanisms can be used, and, depending on the choice, the communication flows in the network will vary. In order to allocate data optimally, one must identify the exact communication flows. It is this that has been ignored in past research. Here a non-linear integer programming model has been formulated for the FAP. It incorporates the Central Node Locking mechanism for concurrency control. The model has been solved using an algorithm called ZOOM/XMP. Detailed analysis has been carried out for various configurations. Assumed values have been used for the various non-decision parameters that need to be entered.

Original languageEnglish (US)
Pages (from-to)169-180
Number of pages12
JournalInformation and Management
Volume17
Issue number3
DOIs
Publication statusPublished - 1989

    Fingerprint

Keywords

  • Communication Networks
  • Concurrency Control
  • Distributed Database Systems
  • File Allocation
  • Integer Programming
  • Two Phase Locking

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Management Information Systems
  • Information Systems
  • Information Systems and Management
  • Engineering(all)

Cite this