AnonymousFox

//usr/share/doc/db4-devel-4.7.25/ref/lock/twopl.html

<html>
<head>
<title>Berkeley DB Reference Guide: Locking with transactions: two-phase locking</title>
<meta name="description" content="Berkeley DB: An embedded database programmatic toolkit.">
<meta name="keywords" content="embedded,database,programmatic,toolkit,btree,hash,hashing,transaction,transactions,locking,logging,access method,access methods,Java,C,C++">
</head>
<body bgcolor=white>
<a name="2"></a>
<table width="100%"><tr valign=top>
<td><dl><dt>Berkeley DB Reference Guide:<dd>Locking Subsystem</dl></td>
<td align=right><a href="../lock/notxn.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../lock/cam_conv.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Locking with transactions: two-phase locking
Berkeley DB uses a locking protocol called two-phase locking (2PL). This
is the traditional protocol used in conjunction with lock-based transaction
systems.
In a two-phase locking system, transactions are divided into two
distinct phases. During the first phase, the transaction only acquires
locks; during the second phase, the transaction only releases locks.
More formally, once a transaction releases a lock, it may not acquire
any additional locks. Practically, this translates into a system in
which locks are acquired as they are needed throughout a transaction
and retained until the transaction ends, either by committing or
aborting. In Berkeley DB, locks are released during <a href="../../api_c/txn_abort.html">DB_TXN-&gt;abort</a> or
<a href="../../api_c/txn_commit.html">DB_TXN-&gt;commit</a>. The only exception to this protocol occurs when we
use lock-coupling to traverse a data structure. If the locks are held
only for traversal purposes, it is safe to release locks before
transactions commit or abort.
For applications, the implications of 2PL are that long-running
transactions will hold locks for a long time. When designing
applications, lock contention should be considered. In order to reduce
the probability of deadlock and achieve the best level of concurrency
possible, the following guidelines are helpful.
<ol>
<li>When accessing multiple databases, design all transactions so that they
access the files in the same order.
<li>If possible, access your most hotly contested resources last (so that
their locks are held for the shortest time possible).
<li>If possible, use nested transactions to protect the parts of your
transaction most likely to deadlock.
</ol>
<table width="100%"><tr><td> </td><td align=right><a href="../lock/notxn.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../lock/cam_conv.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Copyright (c) 1996,2008 Oracle. All rights reserved.
</body>
</html>