Andrew Noyes
4b7d6d6cfb
Some checks failed
Tests / Release [gcc] total: 523, passed: 523
GNU C Compiler (gcc) |Total|New|Outstanding|Fixed|Trend
|:-:|:-:|:-:|:-:|:-:
|0|0|0|0|:clap:
Reference build: <a href="https://jenkins.weaselab.dev/job/weaselab/job/conflict-set/job/main/3//gcc">weaselab » conflict-set » main #3</a>
weaselab/conflict-set/pipeline/head There was a failure building this commit
25 lines
1.0 KiB
TeX
25 lines
1.0 KiB
TeX
\documentclass[twocolumn]{article}
|
|
|
|
\usepackage{hyperref}
|
|
|
|
\title{ARTful Conflict Checking for FoundationDB}
|
|
\author{Andrew Noyes \\ \href{mailto:andrew@weaselab.dev}{andrew@weaselab.dev}}
|
|
\date{}
|
|
|
|
\usepackage{biblatex}
|
|
\bibliography{bibliography}
|
|
|
|
\begin{document}
|
|
|
|
\maketitle
|
|
|
|
\section{Abstract}
|
|
|
|
FoundationDB \cite{DBLP:conf/sigmod/ZhouXSNMTABSLRD21} provides serializability using a specialized data structure called \textit{lastCommit} \footnote{See Algorithm 1 referenced in \cite{DBLP:conf/sigmod/ZhouXSNMTABSLRD21}}.
|
|
This data structure maps key ranges (sets of keys denoted by either a singleton key or a half-open interval) to a ``commit version'' represented as a 64-bit integer.
|
|
FoundationDB implements \textit{lastCommit} as a version-augmented probabilistic SkipList \cite{10.1145/78973.78977}.
|
|
In this paper, we propose an alternative implementation of \textit{lastCommit} as a version-augmented Adaptive Radix Tree \cite{DBLP:conf/icde/LeisK013}, and evaluate its performance.
|
|
|
|
\printbibliography
|
|
|
|
\end{document} |