From fcdbcbcd45dc567792429bb314df53b42ed9f22e Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Fri, 27 Jun 2025 15:21:38 -0400
Subject: updates

---
 chapters/sigmod23/background.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'chapters/sigmod23/background.tex')

diff --git a/chapters/sigmod23/background.tex b/chapters/sigmod23/background.tex
index 42a52de..984e36c 100644
--- a/chapters/sigmod23/background.tex
+++ b/chapters/sigmod23/background.tex
@@ -226,7 +226,7 @@ structure, a technique called \emph{alias augmentation}~\cite{tao22}. For
 example, alias augmentation can be used to construct an SSI capable of
 answering WIRS queries in $\Theta(\log n + k)$~\cite{afshani17,tao22}.
 This structure breaks the data into multiple disjoint partitions of size
-$\nicefrac{n}{\log n}$, each with an associated alias structure. A B+Tree
+$\nicefrac{n}{\log n}$, each with an associated alias structure. A B+tree
 is then built, using the augmented partitions as its leaf nodes. Each
 internal node is also augmented with an alias structure over the aggregate
 weights associated with the children of each pointer. Constructing this
@@ -266,7 +266,7 @@ following desiderata,
 
 \begin{enumerate}
     \item Support data updates (including deletes) with similar average
-          performance to a standard B+Tree.
+          performance to a standard B+tree.
     \item Support IQS queries that do not pay a per-sample cost
           proportional to some function of the data size. In other words,
           $k$ should \emph{not} be be multiplied by any function of $n$
-- 
cgit v1.2.3

