1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
<!--$Id: bigpic.so,v 8.32 2003/11/27 18:25:57 bostic Exp $-->
<!--Copyright 1997-2006 by Oracle Corporation-->
<!--All rights reserved.-->
<!--See the file LICENSE for redistribution information.-->
<html>
<head>
<title>Berkeley DB Reference Guide: The big picture</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><h3><dl><dt>Berkeley DB Reference Guide:<dd>Architecture</dl></h3></td>
<td align=right><a href="../java/faq.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../arch/progmodel.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
<p>
<h3 align=center>The big picture</h3>
<p>The previous chapters in this Reference Guide have described
applications that use the Berkeley DB access methods for fast data storage
and retrieval. The applications described in the following chapters
are similar in nature to the access method applications, but they are
also threaded and/or recoverable in the face of application or system
failure.</p>
<p>Application code that uses only the Berkeley DB access methods might appear
as follows:</p>
<blockquote><pre>switch (ret = dbp->put(dbp, NULL, &key, &data, 0)) {
case 0:
printf("db: %s: key stored.\n", (char *)key.data);
break;
default:
dbp->err(dbp, ret, "dbp->put");
exit (1);
}</pre></blockquote>
<p>The underlying Berkeley DB architecture that supports this is</p>
<p align=center><img src="smallpic.gif" alt="small">
<p>As you can see from this diagram, the application makes calls into the
access methods, and the access methods use the underlying shared memory
buffer cache to hold recently used file pages in main memory.</p>
<p>When applications require recoverability, their calls to the Access
Methods must be wrapped in calls to the transaction subsystem. The
application must inform Berkeley DB where to begin and end transactions, and
must be prepared for the possibility that an operation may fail at any
particular time, causing the transaction to abort.</p>
<p>An example of transaction-protected code might appear as follows:</p>
<blockquote><pre>for (fail = 0;;) {
/* Begin the transaction. */
if ((ret = dbenv->txn_begin(dbenv, NULL, &tid, 0)) != 0) {
dbenv->err(dbenv, ret, "dbenv->txn_begin");
exit (1);
}
<p>
/* Store the key. */
switch (ret = dbp->put(dbp, tid, &key, &data, 0)) {
case 0:
/* Success: commit the change. */
printf("db: %s: key stored.\n", (char *)key.data);
if ((ret = tid->commit(tid, 0)) != 0) {
dbenv->err(dbenv, ret, "DB_TXN->commit");
exit (1);
}
return (0);
case DB_LOCK_DEADLOCK:
default:
/* Failure: retry the operation. */
if ((t_ret = tid->abort(tid)) != 0) {
dbenv->err(dbenv, t_ret, "DB_TXN->abort");
exit (1);
}
if (fail++ == MAXIMUM_RETRY)
return (ret);
continue;
}
}</pre></blockquote>
<p>In this example, the same operation is being done as before; however,
it is wrapped in transaction calls. The transaction is started with
<a href="../../api_c/txn_begin.html">DB_ENV->txn_begin</a> and finished with <a href="../../api_c/txn_commit.html">DB_TXN->commit</a>. If the
operation fails due to a deadlock, the transaction is aborted using
<a href="../../api_c/txn_abort.html">DB_TXN->abort</a>, after which the operation may be retried.</p>
<p>There are actually five major subsystems in Berkeley DB, as follows:</p>
<dl compact>
<dt>Access Methods<dd>The access methods subsystem provides general-purpose support for
creating and accessing database files formatted as Btrees, Hashed files,
and Fixed- and Variable-length records. These modules are useful in
the absence of transactions for applications that need fast formatted
file support. See <a href="../../api_c/db_open.html">DB->open</a> and <a href="../../api_c/db_cursor.html">DB->cursor</a> for more
information. These functions were already discussed in detail in the
previous chapters.
<dt>Memory Pool<dd>The Memory Pool subsystem is the general-purpose shared memory buffer pool
used by Berkeley DB. This is the shared memory cache that allows multiple
processes and threads within processes to share access to databases. This
module is useful outside of the Berkeley DB package for processes that require
portable, page-oriented, cached, shared file access.
<dt>Transaction<dd>The Transaction subsystem allows a group of database changes to be
treated as an atomic unit so that either all of the changes are done,
or none of the changes are done. The transaction subsystem implements
the Berkeley DB transaction model. This module is useful outside of the Berkeley DB
package for processes that want to transaction-protect their own data
modifications.
<dt>Locking<dd>The Locking subsystem is the general-purpose lock manager used by Berkeley DB.
This module is useful outside of the Berkeley DB package for processes that
require a portable, fast, configurable lock manager.
<dt>Logging<dd>The Logging subsystem is the write-ahead logging used to support the
Berkeley DB transaction model. It is largely specific to the Berkeley DB package,
and unlikely to be useful elsewhere except as a supporting module for
the Berkeley DB transaction subsystem.
</dl>
<p>Here is a more complete picture of the Berkeley DB library:</p>
<p align=center><img src="bigpic.gif" alt="large">
<p>In this model, the application makes calls to the access methods and to
the Transaction subsystem. The access methods and Transaction subsystems
in turn make calls into the Memory Pool, Locking and Logging subsystems
on behalf of the application.</p>
<p>The underlying subsystems can be used independently by applications.
For example, the Memory Pool subsystem can be used apart from the rest
of Berkeley DB by applications simply wanting a shared memory buffer pool, or
the Locking subsystem may be called directly by applications that are
doing their own locking outside of Berkeley DB. However, this usage is not
common, and most applications will either use only the access methods
subsystem, or the access methods subsystem wrapped in calls to the Berkeley DB
transaction interfaces.</p>
<table width="100%"><tr><td><br></td><td align=right><a href="../java/faq.html"><img src="../../images/prev.gif" alt="Prev"></a><a href="../toc.html"><img src="../../images/ref.gif" alt="Ref"></a><a href="../arch/progmodel.html"><img src="../../images/next.gif" alt="Next"></a>
</td></tr></table>
<p><font size=1>Copyright (c) 1996-2006 Oracle Corporation - All rights reserved.</font>
</body>
</html>
|
