Affiliation:
1. Univ. of California-Berkeley, Berkeley
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”.
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. System R
2. CODASYL PROGRAMMING LANGUAGE COMMITTEE. Data Base Task Group Report April 1971. (Available from ACM New York.) CODASYL PROGRAMMING LANGUAGE COMMITTEE. Data Base Task Group Report April 1971. (Available from ACM New York.)
3. CODASYL PROGRAMMING LANGUAGE COMMITTEE. CODASYL COBOL Data Base Facility Proposal March 1973. CODASYL PROGRAMMING LANGUAGE COMMITTEE. CODASYL COBOL Data Base Facility Proposal March 1973.
4. System Deadlocks
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献