Gecko [ 122.154.134.11 ]

Name	Size	Permission
admin.html	3.28 KB	-rw-r--r--
app.html	16.29 KB	-rw-r--r--
archival.html	9.52 KB	-rw-r--r--
atomicity.html	4.19 KB	-rw-r--r--
checkpoint.html	4.7 KB	-rw-r--r--
cursor.html	4.99 KB	-rw-r--r--
data_open.html	5.89 KB	-rw-r--r--
deadlock.html	5.78 KB	-rw-r--r--
env_open.html	6.53 KB	-rw-r--r--
fail.html	4.98 KB	-rw-r--r--
faq.html	7.8 KB	-rw-r--r--
filesys.html	4.22 KB	-rw-r--r--
hotfail.html	5.51 KB	-rw-r--r--
inc.html	6.1 KB	-rw-r--r--
intro.html	2.72 KB	-rw-r--r--
logfile.html	3.57 KB	-rw-r--r--
nested.html	4.19 KB	-rw-r--r--
put.html	10.51 KB	-rw-r--r--
read.html	7.93 KB	-rw-r--r--
reclimit.html	9.7 KB	-rw-r--r--
recovery.html	6.42 KB	-rw-r--r--
term.html	4.09 KB	-rw-r--r--
throughput.html	7.14 KB	-rw-r--r--
transapp.cs	10.34 KB	-rw-r--r--
tune.html	10.76 KB	-rw-r--r--
why.html	2.49 KB	-rw-r--r--
writetest.cs	2.32 KB	-rw-r--r--

Code Editor : term.html

<html>
<head>
<title>Berkeley DB Reference Guide: Terminology</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>
<table width="100%"><tr valign=top>
<td><dl><dt>Berkeley DB Reference Guide:<dd>Berkeley DB Transactional Data Store Applications</dl></td>
<td align=right><a href="../transapp/why.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../transapp/fail.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Terminology
Here are some definitions that will be helpful in understanding
transactions:
 
Thread of control<ul compact><li>Berkeley DB is indifferent to the type or style of threads being used by the
application; or, for that matter, if threads are being used at all --
because Berkeley DB supports multiprocess access. In the Berkeley DB documentation,
any time we refer to a thread of control, it can be read as
a true thread (one of many in an application's address space) or a
process.</ul>
Free-threaded<ul compact><li>A Berkeley DB handle that can be used by multiple threads simultaneously
without any application-level synchronization is called
free-threaded.</ul>
Transaction<ul compact><li>A transaction is a one or more operations on one or more
databases that should be treated as a single unit of work. For example,
changes to a set of databases, in which either all of the changes must be
applied to the database(s) or none of them should. Applications specify
when each transaction starts, what database operations are included in
it, and when it ends.</ul>
Transaction abort/commit<ul compact><li>Every transaction ends by committing or aborting.
If a transaction commits, Berkeley DB guarantees that any database changes
included in the transaction will never be lost, even after system or
application failure. If a transaction aborts, or is uncommitted when
the system or application fails, then the changes involved will never
appear in the database.</ul>
System or application failure<ul compact><li>System or application failure is the phrase we use to
describe something bad happening near your data. It can be an
application dumping core, being interrupted by a signal, the disk
filling up, or the entire system crashing. In any case, for whatever
reason, the application can no longer make forward progress, and its
databases are left in an unknown state.</ul>
Recovery<ul compact><li>Recovery is what makes the database consistent after a system
or application failure. The recovery process includes review of log
files and databases to ensure that the changes from each committed
transaction appear in the database, and that no changes from an
unfinished (or aborted) transaction do. Whenever system or application
failure occurs, applications must usually run recovery.</ul>
Deadlock<ul compact><li>Deadlock, in its simplest form, happens when one thread of
control owns resource A, but needs resource B; while another thread of
control owns resource B, but needs resource A. Neither thread of
control can make progress, and so one has to give up and release all
its resources, at which time the remaining thread of control can make
forward progress.</ul>
 
<table width="100%"><tr><td> </td><td align=right><a href="../transapp/why.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../transapp/fail.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
Copyright (c) 1996,2008 Oracle. All rights reserved.
</body>
</html>

${this.title}

Code Editor : term.html