diff --git a/semester4/dmdb/data-modelling-databases-summary.pdf b/semester4/dmdb/data-modelling-databases-summary.pdf
index 93f4a91..eb5aa93 100644
Binary files a/semester4/dmdb/data-modelling-databases-summary.pdf and b/semester4/dmdb/data-modelling-databases-summary.pdf differ
diff --git a/semester4/dmdb/parts/03_systems/02_indexing/01_b-trees/02_operations.tex b/semester4/dmdb/parts/03_systems/02_indexing/01_b-trees/02_operations.tex
index a2441e4..7dc8ceb 100644
--- a/semester4/dmdb/parts/03_systems/02_indexing/01_b-trees/02_operations.tex
+++ b/semester4/dmdb/parts/03_systems/02_indexing/01_b-trees/02_operations.tex
@@ -5,7 +5,7 @@ When we reach a leaf node, we return the corresponding pointer and the position.
 
 
 \subparagraph{Range Lookup}
-We return all tuples that match, by first finding the first tuple matching, the continue traversal until the last match is found.
+We return all tuples that match, by first finding the first tuple matching, then continue traversal until the last match is found.
 We can determine the last match easily because the tree's leafs are lexicographically sorted.
 Since the leafs are linked as linked lists, we can simply move along the linked lists, cutting down on processing time.