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

Try building paper in jenkins

Browse Source
This commit is contained in:
andrew
2024-02-05 12:29:53 -08:00
parent 10b7f405a0
commit 4b7d6d6cfb
3 changed files with 15 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
paper/paper.tex
+6 -5
View File
@@ -1,10 +1,11 @@
\documentclass[twocolumn]{article}
\title{ARTful conflict checking for FoundationDB}
\author{Andrew Noyes}
\usepackage{hyperref}
\title{ARTful Conflict Checking for FoundationDB}
\author{Andrew Noyes \\ \href{mailto:andrew@weaselab.dev}{andrew@weaselab.dev}}
\date{}
\usepackage{hyperref}
\usepackage{biblatex}
\bibliography{bibliography}
@@ -14,8 +15,8 @@
\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 \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.