diff options
Diffstat (limited to 'chapters/sigmod23/experiment.tex')
| -rw-r--r-- | chapters/sigmod23/experiment.tex | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/chapters/sigmod23/experiment.tex b/chapters/sigmod23/experiment.tex index 1eb704c..14f59a7 100644 --- a/chapters/sigmod23/experiment.tex +++ b/chapters/sigmod23/experiment.tex @@ -60,7 +60,7 @@ following dynamized structures, \item \textbf{DE-WSS.} An implementation of the dynamized alias structure~\cite{walker74} for weighted set sampling discussed in Section~\ref{ssec:wss-struct}. We compare this against a WSS -implementation of Olken's method on a B+Tree with aggregate weight tags +implementation of Olken's method on a B+tree with aggregate weight tags (\textbf{AGG-BTree})~\cite{olken95}, based on the B+tree implementation in the TLX library~\cite{tlx}. @@ -71,24 +71,24 @@ Section~\ref{ssec:ext-concurrency} and an external version from Section~\ref{ssec:ext-external}. We compare the external and concurrent versions against the AB-tree~\cite{zhao22}, and the single-threaded, in memory version was compare with an IRS implementation of Olken's -method on an AGG-BTree. +method on an \texttt{AGG-BTree}. \item \textbf{DE-WIRS.} An implementation of the dynamized alias-augmented -B+Tree~\cite{afshani17} as discussed in Section~\ref{ssec:wirs-struct} for +B+tree~\cite{afshani17} as discussed in Section~\ref{ssec:wirs-struct} for weighted independent range sampling. We compare this against a WIRS -implementation of Olken's method on an AGG-BTree. +implementation of Olken's method on \texttt{AGG-BTree}. \end{itemize} All of the tested structures, with the exception of the external memory -DE-IRS implementation and AB-Tree, were wholly contained within system -memory. AB-Tree is a native external structure, so for the in-memory +DE-IRS implementation and AB-tree, were wholly contained within system +memory. AB-tree is a native external structure, so for the in-memory concurrency evaluation we configured it with enough cache to maintain the entire structure in memory to simulate an in-memory implementation.\footnote{ Because of the nature of sampling queries, traditional - efficient locking techniques for B+Trees are not able to be - used~\cite{zhao22}. The alternatives were to run AB-Tree in this - manner, or to globally lock the B+Tree for every operation. We + efficient locking techniques for B+trees are not able to be + used~\cite{zhao22}. The alternatives were to run AB-tree in this + manner, or to globally lock the B+tree for every operation. We elected to use the former approach for this chapter. We used the latter approach in the next chapter. } |