1 files changed, 2 insertions, 2 deletions

diff --git a/chapters/sigmod23/extensions.tex b/chapters/sigmod23/extensions.tex
index 3a3cba3..3304b76 100644
--- a/chapters/sigmod23/extensions.tex
+++ b/chapters/sigmod23/extensions.tex
@@ -56,7 +56,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, created a proof-of-concept dynamization of an
+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
 controlled scheme for log-structured data stores~\cite{golan-gueta15}.
 
@@ -79,7 +79,7 @@ accessing them have finished.
 The buffer itself is an unsorted array, so a query can capture a
 consistent and static version by storing the tail pointer at the time
 the query begins. New inserts can be performed concurrently by doing
-a fetch-and-and on the tail. By using multiple buffers, inserts and
+a fetch-and-add on the tail. By using multiple buffers, inserts and
 reconstructions can proceed, to some extent, in parallel, which helps to
 hide some of the insertion tail latency due to blocking on reconstructions
 during a buffer flush.