On Optimistic Methods for Concurrency Control.

reportActive / Technical Report | Accession Number: ADA081452 | Open PDF

Abstract:

Most current approaches to concurrency control in database systems rely on locking of a data objects as a control mechanism. In this paper, two families of non-locking concurrency controls are presented. The methods used are optimistic in the sense that rely mainly on transaction backup as a control mechanism, hoping that conflicts between transactions will not occur. Applications where these methods should be more efficient than locking are discussed. Author

Author(s):
Kung, H. T. ; Robinson, John T.
Author Organization(s):
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Descriptive Note:
Interim rept.,
Pagination:
0020

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
CMU-CS-79-149
Contract/Grant Number(s):
N00014-76-C-0370, NSF-MCS78-23676
 Subject Terms
Joint Capability Areas:
JCA_1_Force Support; JCA_5_Command and Control; JCA_4.3_Maintain; JCA_6.1_Information Transport; JCA_6_Net Centric; JCA_1.3_Human Capital Management; JCA_5.3_Planning; JCA_1.3.2_Personnel Management; JCA_3.2_Engagement; JCA_3_Force Application
Communities of Interest:
Materials and Manufacturing Processes
Descriptor(s):
*DATA BASES, *ACCESS, *MULTIPROCESSORS, *CONTROL THEORY, *CONTROL SEQUENCES, ALGORITHMS, VALIDATION, NODES, MEMORY DEVICES, READ OUT TECHNIQUES
Field(s)/Group(s):
Theoretical Mathematics, Computer Programming and Software, Computer Hardware
Keyword(s):
Locking protocols, Pointers, Roots, Directed graphs, Deadlockfree protocols, Secondary memories, Write in techniques, Data objects, Concurrency control
Report Date:
1979 Oct 01