A model for database allocation incorporating a concurrency control mechanism

Author

Ram, Sudha ; Marsten, Roy E.

Author_Institution

Dept. of Manage. Inf. Syst., Arizona Univ., Tucson, AZ, USA

Volume

3

Issue

3

fYear

1991

fDate

9/1/1991 12:00:00 AM

Firstpage

389

Lastpage

395

Abstract

The impact of incorporating a specific concurrency control mechanism (CCM) into the file allocation problem (FAP) is discussed. Depending on the specific CCM use, the communication flows in a network will vary. To allocate data optimally, one must identify the exact communication flows in the network. It is this aspect that has been ignored in past research on the FAP. A linear mixed-integer programming model formulated for the FAP is given. The model incorporates the WRITE LOCKS ALL-READ LOCKS ONE mechanism for concurrency control. A special algorithm based on the implicit representation of variable upper bounds is developed to solve the model. Detailed analysis for various configurations of a network is performed. Several potential applications for the model are identified

Keywords

concurrency control; database theory; distributed databases; WRITE LOCKS ALL-READ LOCKS ONE; communication flows; concurrency control mechanism; database allocation; file allocation problem; linear mixed-integer programming model; Application software; Concurrency control; Database systems; Distributed computing; Distributed databases; Financial advantage program; Linear programming; Mathematical model; Power system modeling; Upper bound;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.91051

Filename

91051