Issue No. 03 - September (1991 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.91051
<p>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.</p>
database allocation; concurrency control mechanism; file allocation problem; communication flows; linear mixed-integer programming model; WRITE LOCKS ALL-READ LOCKS ONE; concurrency control; database theory; distributed databases
R. Marsten and S. Ram, "A Model for Database Allocation Incorporating a Concurrency Control Mechanism," in IEEE Transactions on Knowledge & Data Engineering, vol. 3, no. , pp. 389-395, 1991.