ACM Home Page
Please provide us with feedback. Feedback
Analysis of locking policies in database management systems
Full text PdfPdf (906 KB)
Source
Communications of the ACM archive
Volume 23 ,  Issue 10  (October 1980) table of contents
Pages: 584 - 593  
Year of Publication: 1980
ISSN:0001-0782
Authors
D. Potier  INRIA, Chesnay, France
Ph. Leblanc  INRIA, Chesnay, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 38,   Citation Count: 36
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359015.359021
What is a DOI?

ABSTRACT

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 locking policy which ensures integrity of the information. However, a drawback of integrity enforcement through locking policies is the degradation of the global system performance. This is mainly due to the restriction imposed by the locking policies to the access of transactions to the database, and to the overheads involved with the management of locks. A framework for the quantitative analysis of the impact of these factors on the performance of DBMS is presented in this paper. In a first step, the main factors which determine the behavior of these systems are pointed out and analyzed independently. The results hereby obtained are aggregated in a second step to yield a global performance evaluation. Throughout this hierarchical modeling approach various analytical techniques are used and the results are illustrated by numerical examples. The paper concludes by pointing out the final results' sensitivity to some basic assumptions concerning transaction behavior and the need for more experimental studies in this area.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Denning, P.J., Kahn, K.C., Leroudier, J., Potier, D., and Suri, R. Optimal multiprogramming. Acta Inform. 7, 2 (1976), 197-216.
5
 
6
Merle, D., Potier, D., and Veran, M. A tool for computer system performance analysis. Proc. Internat. Conf. on Performance of Comptr. Installations 1978, North-Holland Pub. Co., Amsterdam, 1978, pp. 195-214.
7
 
8
Riordan, J. An Introduction to Combinatorial Analysis. John Wiley and Sons, N.Y., 1958.
9
10
 
11
Rodriguez-Rosell, J. Empirical data reference behaviour in database systems. Computer 9, 11 (Nov. 1976), 9-13.
 
12
Rodriguez-Rosell, J., and Hildebrand, D. A framework for evaluation of database management system. Proc. Internat. Comptng. Symp. 1975, E. Gelenbe and D. Potier, Eds., North-Holland Pub. Co., Amsterdam, 1975.
13
14
 
15
Tuel, W.G., and Rodriguez-Rosell, J. A methodology for evaluation of database systems. Res. Rep. RJ 1688, IBM Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y., 1976.
 
16
Veran, M. QNAP description language. Res. Rep., Antenne Scientifique CII-Honeywell-Bull, Grenoble, France, 1979.

CITED BY  36