This commit is contained in:
Eric Brewer 2006-04-25 01:50:20 +00:00
parent 6c2869c11f
commit 7643cb6275

View file

@ -1052,7 +1052,7 @@ as a baseline for our experiments.
Both of our hashtables outperform Berkeley DB on a workload that Both of our hashtables outperform Berkeley DB on a workload that
bulk loads the tables by repeatedly inserting (key, value) pairs. bulk loads the tables by repeatedly inserting (key, value) pairs.
However, we do not wish to imply this is always the case. %although we do not wish to imply this is always the case.
%We do not claim that our partial implementation of \yad %We do not claim that our partial implementation of \yad
%generally outperforms, or is a robust alternative %generally outperforms, or is a robust alternative
%to Berkeley DB. Instead, this test shows that \yad is comparable to %to Berkeley DB. Instead, this test shows that \yad is comparable to