From 7643cb62759afe1230d337dfeb2d2641318f49d8 Mon Sep 17 00:00:00 2001 From: Eric Brewer Date: Tue, 25 Apr 2006 01:50:20 +0000 Subject: [PATCH] cleanup --- doc/paper3/LLADD.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/paper3/LLADD.tex b/doc/paper3/LLADD.tex index e1944fc..dfacad6 100644 --- a/doc/paper3/LLADD.tex +++ b/doc/paper3/LLADD.tex @@ -1051,8 +1051,8 @@ hashtable is a popular, commonly deployed implementation, and serves as a baseline for our experiments. Both of our hashtables outperform Berkeley DB on a workload that -bulk loads the tables by repeatedly inserting (key, value) pairs. -However, we do not wish to imply this is always the case. +bulk loads the tables by repeatedly inserting (key, value) pairs. +%although we do not wish to imply this is always the case. %We do not claim that our partial implementation of \yad %generally outperforms, or is a robust alternative %to Berkeley DB. Instead, this test shows that \yad is comparable to