summaryrefslogtreecommitdiffstats
path: root/chapters/sigmod23/extensions.tex
diff options
context:
space:
mode:
Diffstat (limited to 'chapters/sigmod23/extensions.tex')
-rw-r--r--chapters/sigmod23/extensions.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/sigmod23/extensions.tex b/chapters/sigmod23/extensions.tex
index 053c8e2..f77574d 100644
--- a/chapters/sigmod23/extensions.tex
+++ b/chapters/sigmod23/extensions.tex
@@ -19,7 +19,7 @@ to reside in memory, and the rest on disk. This allows for the smallest
few shards, which sustain the most reconstructions, to reside in memory
for performance, while storing most of the data on disk, in an attempt
to get the best of both worlds, so to speak.\footnote{
- In traditional LSM Trees, which are an external data structure,
+ In traditional LSM trees, which are an external data structure,
only the memtable resides in memory. We have decided to break with
this model because, for query performance reasons, the mutable
buffer must remain small. By placing a few levels in memory, the
@@ -58,7 +58,7 @@ structure using in XDB~\cite{li19}.
Because our dynamization technique is built on top of static data
structures, a limited form of concurrency support is straightforward to
implement. To that end, we created a proof-of-concept dynamization of an
-ISAM Tree for IRS based on a simplified version of a general concurrency
+ISAM tree for IRS based on a simplified version of a general concurrency
controlled scheme for log-structured data stores~\cite{golan-gueta15}.
First, we restrict ourselves to tombstone deletes. This ensures that