Abstract
Many database systems guarantee some form of integrity control upon multiple concurrent updates by some form of locking. Some “granule” of the database is chosen as the unit which is individually locked, and a lock management algorithm is used to ensure integrity. Using a simulation model, this paper explores the desired size of a granule. Under a wide variety of seemingly realistic conditions, surprisingly coarse granularity is called for. The paper concludes with some implications of these results concerning the viability of so-called “predicate locking”.
- 1 ASTRAHAN, M:.M., ET AL. System R" Relational approach to database management. ACM Trans. Database Syst. 1, 2 (June 1976), 97-137. Google ScholarDigital Library
- 2 CHAMBERLIN, D., ~T AL. A deadlock-free scheme for resource locking in a data dase environment. Proc. IFIPS 74 Congr., North-Holland Pub. Co., Amsterdam, 1974, pp. 340-343.Google Scholar
- 3 CODASYL PROGRAMMING LANGUAGE COMMITTEE. Data Base Task Group Report, April 1971. (Available from ACM, New York.)Google Scholar
- 4 CODASYL PROGRAMMING LANGUAGE COMMITTEE. CODASYL COBOL Data Base Facility Proposal, March 1973.Google Scholar
- 5 COFFMAN, E., ET AL. System deadlocks. Computing Surveys 3, 2 (June 1971), 67-78. Google ScholarDigital Library
- 6 DATE, C.J. An Introduction to Data Base Systems. Addison-Wesley, Reading, Mass., 1975. Google ScholarDigital Library
- 7 ESWARAN, K.P., GRAY, J.H., LORIE, R.A., AND TRAIGER, L.I. The notions of consistency and predicate locks in a database system. Comm. ACM 19, 11 (Nov. 1976), 624-633. Google ScholarDigital Library
- 8 FLORENTIN, J.J. Consistency auditing of data bases. Comptr. J. 17, 1 (Feb. 1974), 52-58.Google ScholarCross Ref
- 9 GRAr, J.N., LORIE, R.A., AND PUTZOLU, G.R. Granularity of locks in a shared data base. Proc. Int. Conf. on Very Large Data Bases, Framingham, Mass., Sept. 1975, pp. 428-451.Google ScholarDigital Library
- 10 GRit, J.N., LORIE, R.A., PvrzoT.v, G.R., ~) TR~Io~R, I.L. Granularity of locks and degrees of consistency in a shared data base. Proc. IFIP Working Conf. on Modelling of Data Base Manage. Syst., Freudenstadt, Germany, Jan. 1976, pp. 695~723.Google Scholar
- 11 LIPSON, W., AND LhPEZAK, O. LSL user's manual. Tech. Note No. 9, Comptr. Syst. Res. Group, U. of Toronto, Toronto, Ont., Canada, Aug. 1976.Google Scholar
- 12 MACRI, P. Deadlock detection and resolution in a CODASYL based data management system. Proc. 1976 ACM-SIGMOD int. Conf. on Management of Data, Washington, D.C., June 1976, pp. 45-49. Google ScholarDigital Library
- 13 SeITZER, J.F. Performance prototyping of data management applications. Proc. ACM 76 (Annual Conf.), Houston, Tex., Oct. 1976, pp. 287-297. Google ScholarDigital Library
- 14 STEARNS, R.E., ET AL. Concurrency control for data base systems. Proc. IEEE Symp. on Foundations of Comptr. Sci., Oct. 1976, pp. 19-32.Google Scholar
- 15 STONEBRAKER, M. High level integrity assurance in relational data base systems. Memo. ERL-M473, Electron. Res. Lab., U. of California, Berkeley, Aug. 1974.Google Scholar
- 16 S~ONEBRAKEa, M., ET AL. The design and implementation of INURES. ACM Trans. Database Syst. I, 3 (Sept. 1976), 189-222. Google ScholarDigital Library
Index Terms
- Effects of locking granularity in a database management system
Recommendations
Locking granularity revisited
Locking granularity refers to the size and hence the number of locks used to ensure the consistency of a database during multiple concurrent updates. In an earlier simulation study we concluded that coarse granularity, such as area or file locking, is ...
Analysis of locking policies in database management systems
Consistency control has to be enforced in database management systems (DBMS) where several transactions may concurrently access the database. This control is usually achieved by dividing the database into locking units or granules, and by specifying a ...
Lock Conversion in Non-Two-Phase Locking Protocols
A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a ...
Comments