--- LLADD.html 2006-09-06 13:28:58.000000000 -0700 +++ LLADD.html.orig 2006-09-06 12:13:00.000000000 -0700 @@ -8,7 +8,7 @@ - +
@@ -601,8 +601,8 @@
|
The first step in implementing a new operation is to decide
upon an external interface, which is typically cleaner than
directly calling
Although the mechanism used for recovery is similar, the
invariants maintained during recovery have changed. With
conventional transactions, if a page in the page file is
@@ -977,7 +977,7 @@
performed by redo are blind updates, they can be applied
regardless of whether the initial page was the correct version
or even logically consistent.
-
Figure 3 describes a page that is torn during crash, and the
actions performed by redo that repair it. Assume that the
@@ -1105,7 +1105,7 @@
This section presents two hash table implementations built
on top of Stasis, and compares them with the hash table
provided by Berkeley DB. One of the Stasis implementations
@@ -1187,18 +1187,18 @@
Both of our hash tables outperform Berkeley DB on a
workload that populates the tables by repeatedly inserting
In this experiment, Berkeley DB was configured as
described above. We ran MySQL using InnoDB for the
table engine. For this benchmark, it is the fastest engine
@@ -1443,7 +1443,7 @@
search traversal and the prioritized traversal both perform
well. As locality decreases, the partitioned traversal
algorithm outperforms the naive traversal.
-
@@ -833,8 +833,8 @@
+
@@ -989,8 +989,8 @@
+
5.2 Linear hash table
-
@@ -1116,8 +1116,8 @@
-
+
@@ -1142,8 +1142,8 @@
+
+
@@ -1346,8 +1346,8 @@
+