This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Model for Database Allocation Incorporating a Concurrency Control Mechanism
September 1991 (vol. 3 no. 3)
pp. 389-395

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.

[1] P. M. G. Apers, "Data allocation in distributed database systems,"ACM Trans. on Database Syst., vol. 16, no. 5, pp. 263-304, Sept. 1988.
[2] G.G. Belford, "Distributed database techniques: An assessment," inCurrent Directions in Database Management Development. New York: Auerbach, 1982, pp. 1-12.
[3] G. Casey, "Design of tree networks for distributed data."Proc. NCC, vol. 41, 251-257, 1973.
[4] S. Ceri, G. Martella, and G. Pelagatti. "Optimal file allocation in a computer network: A solution method based on the knapsack problem,"Comput. Networks, vol. 6, pp. 345-35, 1982.
[5] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[6] M. Chandy and J.E. Hewes, "File allocation in distributed systems," inProc. Int, Symp. Comput. Performance, Modeling, Measurement and Evaluation, Mar. 1976, pp. 10-13.
[7] W. W. Chu, "Multiple file allocation in a multiple computer system,"IEEE Trans. Comput., vol. C-18, pp. 885-889, Oct. 1969.
[8] R. A. Davenport, "Design of distributed database systems,"Comput. J., vol. 24, no. 1, pp. 31-41, 1981.
[9] L. W. Dowdy, and D. V. Foster, "Comparative models of the file ss-signment problem,"ACM Comput. Surveys, vol. 14, no. 2, pp. 287-313, June 1982.
[10] A. Dutta, "Modeling of multiple copy update costs for file allocation in distributed databases,"J. Comput. Inform. Sci., vol. 14, no. 1, pp. 29-34, 1985.
[11] J. Elam and M. Fisher, "The use of mathematical models in distributed database design," inDistributed Databases II, Infotech State-of-the-Art report, 1979, pp. 115-125.
[12] K. P. Eswaran, "Placement of records in a file and file allocation in a computer network," inProc. Inform. Processing 74, 1974, pp. 304-307.
[13] M.L. Fisher and D.S. Hochbaum, "Database location in computer networks,"J. ACM, vol 27, no. 4, pp. 718-735, Oct. 1980.
[14] B. Gavish and H. Pirkul, "Computer and database location in distributed computer systems,"IEEE Trans. Comput., vol. C-35, no. 7, pp. 583-590, July 1986.
[15] N. Goodman and J. B. Rothnie, "A survey of research and development in distributed database management," inProc. Third Int. Conf. Very Large Databases, 1977, pp. 10-27.
[16] E. Grapa and G. G. Belford, "Some theorems to aid in solving the file allocation problem,"Commun. ACM, vol. 20, pp. 878-882, Nov. 1977.
[17] K. B. Irani and N. G. Khabbaz, "A methodology for the design of communication networks and distribution of data in distributed supercomputer systems,"IEEE Trans. Comput., vol. C-31, May 1982.
[18] H. K. Jain, "A comprehensive model for the design of distributed computer systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 1092-1104, Oct. 1987.
[19] W. H. Kohler, "A survey of techniques for synchronization and recovery in decentralized computer systems,"ACM Computing Surveys, vol. 13, pp. 149-182, June 1981.
[20] C. M. Lam and K. T. Fung, "A quadratic programming model for optimal data distribution,"Bit, vol. 21, pp. 294-304, 1981.
[21] L. J. Laning and M. S. Leonard, "File allocation in a distributed computer communication network,"IEEE Trans. Comput., vol. C-32, pp. 232-244, Mar. 1983.
[22] H. L. Morgan and K. D. Levin, "Optimal program and data locations in computer networks,"Commun. ACM, vol. 20, no. 5, pp. 315-322, May 1977.
[23] S. Mahmoud and J. S. Riordan, "Optimal allocation of resources in distributed information networks,"ACM Trans. Database Syst., vol. 1, no. 1, pp. 66-78, Mar. 1976.
[24] R. Marsten, "The design of the XMP linear programming library,"ACM Trans. Math. Software, vol. 7, no. 4, Dec. 1981.
[25] H. Pirkul, "Configuring distributed computer systems with online data-base backups,"Decision Support Syst., no. 3, pp. 37-46, 1987.
[26] C. V. Ramamoorthy and B. W. Wah, "The isomorphism of simple file allocation,"IEEE Trans Comput., vol. C-32, pp. 221-232, Mar. 1983.
[27] S. Ram, "A model for designing distributed database systems,"Inform.&Management, vol. 17, pp. 169-180, 1989.
[28] S. Ram and C. Chastain. "Architecture of distributed database systems,"J. Syst. Software, vol. 10, no. 2, pp. 77-95, Sept. 1989.
[29] L. Schrage, "Implicit representation of variable upper bounds in linear programming,"Mathematics Programming Study, 4. Amsterdam, The Netherlands: North-Holland, 1975.
[30] A. Segall, "Dynamic file assignment in computer networks,"IEEE Trans. Automat. Contr., vol. AC-24, pp. 709-715, Oct. 1979.
[31] J. D. Ullman,Principles of Database Systems, Vol. 1. Rockville, MD: Computer Science Press, 1988.
[32] B. W. Wah, "File placement on distributed computer systems,"IEEE Comput. Mag., pp. 23-32, Jan. 1984.

Index Terms:
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
Citation:
S. Ram, R.E. Marsten, "A Model for Database Allocation Incorporating a Concurrency Control Mechanism," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 3, pp. 389-395, Sept. 1991, doi:10.1109/69.91051
Usage of this product signifies your acceptance of the Terms of Use.