MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES.

Sudha Ram, Geneva G. Belford

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This research is addressed towards solving a problem which falls under the general class of File Allocation Problems (FAP). The main purpose here is to provide a tool for the designer of a distributed database system. With an increasing number of enterprises tending towards distributed systems, a major research question that has come up is how to allocate resources (databases and programs) in a distributed environment. This question has been addressed by formulating a nonlinear integer programming model. Though the same issue has been addressed several times in the past, there is a major difference between the model developed here and all the other models. None of the models in the past have tried to solve the FAP by taking into account the concurrency control mechanism being used. This is a major deficiency of these models because allocation of files is partly based on the communication flows in a network of computers. The communication flows in turn are based on the concurrency control mechanism. It is this weakness that the research here has attempted to overcome by designing a more realistic model.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherACM
Pages428
Number of pages1
ISBN (Print)0897911504
StatePublished - 1985
Externally publishedYes

Fingerprint

Concurrency control
Distributed database systems
Communication
Integer programming
Industry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ram, S., & Belford, G. G. (1985). MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES. In Unknown Host Publication Title (pp. 428). ACM.

MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES. / Ram, Sudha; Belford, Geneva G.

Unknown Host Publication Title. ACM, 1985. p. 428.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ram, S & Belford, GG 1985, MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES. in Unknown Host Publication Title. ACM, pp. 428.
Ram S, Belford GG. MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES. In Unknown Host Publication Title. ACM. 1985. p. 428
Ram, Sudha ; Belford, Geneva G. / MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES. Unknown Host Publication Title. ACM, 1985. pp. 428
@inproceedings{4ac6416c6874476281af0940b9b8c322,
title = "MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES.",
abstract = "This research is addressed towards solving a problem which falls under the general class of File Allocation Problems (FAP). The main purpose here is to provide a tool for the designer of a distributed database system. With an increasing number of enterprises tending towards distributed systems, a major research question that has come up is how to allocate resources (databases and programs) in a distributed environment. This question has been addressed by formulating a nonlinear integer programming model. Though the same issue has been addressed several times in the past, there is a major difference between the model developed here and all the other models. None of the models in the past have tried to solve the FAP by taking into account the concurrency control mechanism being used. This is a major deficiency of these models because allocation of files is partly based on the communication flows in a network of computers. The communication flows in turn are based on the concurrency control mechanism. It is this weakness that the research here has attempted to overcome by designing a more realistic model.",
author = "Sudha Ram and Belford, {Geneva G.}",
year = "1985",
language = "English (US)",
isbn = "0897911504",
pages = "428",
booktitle = "Unknown Host Publication Title",
publisher = "ACM",

}

TY - GEN

T1 - MODEL FOR THE DESIGN OF DISTRIBUTED DATABASES.

AU - Ram, Sudha

AU - Belford, Geneva G.

PY - 1985

Y1 - 1985

N2 - This research is addressed towards solving a problem which falls under the general class of File Allocation Problems (FAP). The main purpose here is to provide a tool for the designer of a distributed database system. With an increasing number of enterprises tending towards distributed systems, a major research question that has come up is how to allocate resources (databases and programs) in a distributed environment. This question has been addressed by formulating a nonlinear integer programming model. Though the same issue has been addressed several times in the past, there is a major difference between the model developed here and all the other models. None of the models in the past have tried to solve the FAP by taking into account the concurrency control mechanism being used. This is a major deficiency of these models because allocation of files is partly based on the communication flows in a network of computers. The communication flows in turn are based on the concurrency control mechanism. It is this weakness that the research here has attempted to overcome by designing a more realistic model.

AB - This research is addressed towards solving a problem which falls under the general class of File Allocation Problems (FAP). The main purpose here is to provide a tool for the designer of a distributed database system. With an increasing number of enterprises tending towards distributed systems, a major research question that has come up is how to allocate resources (databases and programs) in a distributed environment. This question has been addressed by formulating a nonlinear integer programming model. Though the same issue has been addressed several times in the past, there is a major difference between the model developed here and all the other models. None of the models in the past have tried to solve the FAP by taking into account the concurrency control mechanism being used. This is a major deficiency of these models because allocation of files is partly based on the communication flows in a network of computers. The communication flows in turn are based on the concurrency control mechanism. It is this weakness that the research here has attempted to overcome by designing a more realistic model.

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

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

M3 - Conference contribution

AN - SCOPUS:0022188785

SN - 0897911504

SP - 428

BT - Unknown Host Publication Title

PB - ACM

ER -