update

1 files changed, 7 insertions, 6 deletions

diff --git a/chapters/sigmod23/exp-extensions.tex b/chapters/sigmod23/exp-extensions.tex
index 3d3f5b7..df1f4b6 100644
--- a/chapters/sigmod23/exp-extensions.tex
+++ b/chapters/sigmod23/exp-extensions.tex
@@ -38,12 +38,13 @@ dynamic baseline in both sampling and update performance.
 
 Finally, we tested the multi-threaded insertion performance of our
 in-memory, concurrent implementation of \texttt{DE-IRS} compared to
-\texttt{AB-tree} configured to run entirely in memory. We used the
-synthetic uniform dataset (1B records) for this testing, and introduced a
-slight delay between inserts to avoid bottlenecking on the fetch-and-add
-within the mutable buffer. Figure~\ref{fig:con-latency} shows the latency
-vs. throughput curves for the two structures. Note that \texttt{AB-tree}'s
-results are cut off by the y-axis, as it performs significantly worse than
+\texttt{AB-tree} configured with a large enough cache to store the
+data set entirely in memory. We used the synthetic uniform dataset
+(1B records) for this testing, and introduced a slight delay between
+inserts to avoid bottlenecking on the fetch-and-add within the mutable
+buffer. Figure~\ref{fig:con-latency} shows the latency vs. throughput
+curves for the two structures. Note that \texttt{AB-tree}'s results
+are cut off by the y-axis, as it performs significantly worse than
 \texttt{DE-IRS}. Figure~\ref{fig:con-tput} shows the insertion throughput
 as additional insertion threads are added. Both plots show linear scaling
 up to 3 or 4 threads, before the throughput levels off. Further, even