[DMDB] Fix more errors

semester4/dmdb/parts/08_quick-overview/03_qp.tex

@@ -1,6 +1,6 @@
 \subsection{Query Processing}
 \subsubsection{Sorting}
-Given $B$ frames of memory and $N$ records, we ahve
+Given $B$ frames of memory and $N$ records, we have (typically I/Os in pages to be read)
 \begin{itemize}
     \item \bi{Merge Sort}: $2N \cdot P$, with $P = (1 + \ceil{\log_{B - 1}\ceil{N \div B}})$ the number of passes.
           After the first pass, $\ceil{N \div B}$ number of sorted runs were created (typically)

semester4/dmdb/parts/08_quick-overview/04_checklist.tex

@@ -9,6 +9,7 @@ The following things are typically important to know very well (not exhaustive)
     \item Conflict Serializability
     \item Core concepts of Vector Search
     \item Recoverability (both the normal techniques, plus Snapshot Isolation and 2-Phase Locking (and strict variant thereof))
+    \item Rewriting rules
 \end{todolist}
 
 Note that since this course is taught (quite) poorly, there may be wrong questions or possibly even questions that are somewhat outside the scope of this course