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
|
<! "@(#)index.html 10.6 (Sleepycat) 10/20/98">
<html>
<head>
<title>Berkeley DB: Additional Information</title>
</head>
<body bgcolor=white>
<h2>Books:</h2>
<dl>
<p>
<dt><i>Transaction Processing Concepts and Techniques</i>,<dd>
by Jim Gray and Andreas Reuter, Morgan Kaufmann Publishers.
We recommend chapters 1, 4 (skip 4.6, 4.7, 4.9, 4.10 and 4.11),
7, 9, 10.3, and 10.4.
<p>
<dt><i>An Introduction to Database Systems, Volume 1</i>,<dd>
by C.J. Date, Addison Wesley Longman Publishers.
In the 5th Edition, we recommend chapters 1, 2, 3, 16 and 17.
<p>
<dt><i>Concurrency Control and Recovery in Database Systems</i>,<dd>
by Berstein, Goodman, Hadzilaco.
</dl>
<h2>Technical Papers Relating to the Berkeley DB Structure:</h2>
<dl>
<p>
<dt><a href="libtp_usenix.ps">
<i>LIBTP: Portable Modular Transactions for UNIX</i></a>,
<img src="../images/ps.gif"><dd>
Margo Seltzer and Michael Olson, USENIX Conference Proceedings, Winter 1992.
<p>
<dt><i>Operating System Support for Database Management</i>,<dd>
Michael Stonebraker, Communications of the ACM 24(7), 1981, pp. 412-418.
</dl>
<h2>Technical Papers Relating to the Hash Access Method:</h2>
<dl>
<p>
<dt><a href="hash_usenix.ps">
<i>A New Hashing Package for UNIX</i></a>,
<img src="../images/ps.gif"><dd>
Margo Seltzer and Oz Yigit, USENIX Conference Proceedings, Winter 1991.
<p>
<dt><i>Dynamic Hash Tables</i>,<dd>
Per-Ake Larson, Communications of the ACM, April 1988.
<p>
<dt><i>Linear Hashing: A New Tool for File and Table Addressing</i>,<dd>
<a href="witold.html">Witold Litwin</a>, Proceedings of the 6th
International Conference on Very Large Databases (VLDB), 1980
</dl>
<h2>Technical Papers Relating to the Btree Access Method:</h2>
<dl>
<p>
<dt><i>The Ubiquitous B-tree</i>,<dd>
Douglas Comer, ACM Comput. Surv. 11, 2 (June 1979), pp. 121-138.
<p>
<dt><i>Prefix B-trees</i>,<dd>
Bayer and Unterauer, ACM Transactions on Database Systems,
Vol. 2, 1 (March 1977), pp. 11-26.
<p>
<dt><i>The Art of Computer Programming Vol. 3: Sorting and Searching</i>,<dd>
D.E. Knuth, 1968, pp. 471-480.
</dl>
<h2>Technical Papers Relating to the Recno Access Method:</h2>
<dl>
<p>
<dt><i>Document Processing in a Relational Database System</i>,<dd>
Michael Stonebraker, Heidi Stettner, Joseph Kalash, Antonin Guttman,
Nadene Lynn, Memorandum No. UCB/ERL M82/32, May 1982.
</dl>
</body>
</html>
|
