A model for designing distributed database systems

Sudha Ram

doi:10.1016/0378-7206(89)90018-9

A model for designing distributed database systems

Sudha Ram

Research output: Contribution to journal › Article › peer-review

5 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 language	English (US)
Pages (from-to)	169-180
Number of pages	12
Journal	Information and Management
Volume	17
Issue number	3
DOIs	https://doi.org/10.1016/0378-7206(89)90018-9
State	Published - Oct 1989

Keywords

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

ASJC Scopus subject areas

Management Information Systems
Information Systems
Information Systems and Management

Access to Document

10.1016/0378-7206(89)90018-9

Cite this

@article{6896b80cee004a859339e1ab774c6f21,

title = "A model for designing distributed database systems",

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.",

keywords = "Communication Networks, Concurrency Control, Distributed Database Systems, File Allocation, Integer Programming, Two Phase Locking",

author = "Sudha Ram",

year = "1989",

month = oct,

doi = "10.1016/0378-7206(89)90018-9",

language = "English (US)",

volume = "17",

pages = "169--180",

journal = "Information and Management",

issn = "0378-7206",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A model for designing distributed database systems

AU - Ram, Sudha

PY - 1989/10

Y1 - 1989/10

N2 - 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.

AB - 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.

KW - Communication Networks

KW - Concurrency Control

KW - Distributed Database Systems

KW - File Allocation

KW - Integer Programming

KW - Two Phase Locking

UR - http://www.scopus.com/inward/record.url?scp=0024749533&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024749533&partnerID=8YFLogxK

U2 - 10.1016/0378-7206(89)90018-9

DO - 10.1016/0378-7206(89)90018-9

M3 - Article

AN - SCOPUS:0024749533

SN - 0378-7206

VL - 17

SP - 169

EP - 180

JO - Information and Management

JF - Information and Management

IS - 3

ER -

A model for designing distributed database systems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this