weaselbot/conflict-set
1
Fork 0
forked from weaselab/conflict-set
Code Pull Requests Activity

Prepare for tikz files

Browse Source
This commit is contained in:
andrew
2024-02-28 18:28:57 -08:00
parent 7345eceab3
commit 946694b8a5
3 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.vscode/settings.json
Vendored
+5
View File
@@ -0,0 +1,5 @@
{
"files.associations": {
"*.tikz": "latex"
}
}
paper/Makefile
+1 -1
View File
@@ -2,7 +2,7 @@
all: paper.pdf
paper.pdf:
paper.pdf: paper.tex $(wildcard *.tikz)
latexmk -pdf
clean:
paper/paper.tex
+1 -1
View File
@@ -52,7 +52,7 @@ It's possible to trade off the backtracking for the increased overhead of mainta
Our options also have various tradeoffs inherited from their un-augmented versions such as different worst-case and expected bounds on the length of search paths and the number of rotations performed upon insert.
ART has been shown \cite{DBLP:conf/icde/LeisK013} to offer superior performance to comparison-based data structures on modern hardware, which is on its own a compelling reason to consider it.
The Height Optimized Trie (HOT) \cite{binna2018hot} outperforms ART, but has a few practical disadvantages \footnote{HOT has more implementation complexity than the already-daunting ART, and requires AVX2 and BMI2 instructions. HOT also involves rebalancing operations during insertion. Even so, it's likely that a HOT-based \emph{lastCommit} version would be superior.} and will not be considered in this paper.
The Height Optimized Trie (HOT) \cite{binna2018hot} outperforms ART, but has a few practical disadvantages \footnote{Implementing HOT is more complex than the already-daunting ART, and requires AVX2 and BMI2 instructions. HOT also involves rebalancing operations during insertion. Even so, it's likely that a HOT-based \emph{lastCommit} implementation would be superior.} and will not be considered in this paper.
\printbibliography