24 lines
969 B
TeX
24 lines
969 B
TeX
\documentclass[twocolumn]{article}
|
|
|
|
\title{ARTful conflict checking for FoundationDB}
|
|
\author{Andrew Noyes}
|
|
\date{}
|
|
|
|
\usepackage{hyperref}
|
|
\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}.
|
|
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 \footnote{See Algorithm 1 referenced in \cite{DBLP:conf/sigmod/ZhouXSNMTABSLRD21}}.
|
|
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} |