\begin{frame} \frametitle{Example} \begin{quiz}{\textwidth}{} \begin{tcenter} {\small\def\scheduleWidth{1cm} \begin{tikzpicture} \schedule{}{3}{1rV!2+2|2rY|3wV!2+3|1rZ!5+1|2wV!3+2|1rY|3wZ!5+1} \end{tikzpicture} } \end{tcenter} \begin{itemize} \item Is this following schedule conflict-serializable? \end{itemize} \medskip\pause The precedence graph is: \begin{tcenter} \begin{tikzpicture}[node distance=15mm,inner sep=1mm,outer sep=0] \node (t1) {$T_1$}; \node (t3) [below right of=t1] {$T_3$}; \node (t2) [above right of=t3] {$T_2$}; \begin{scope}[very thick,->] \mpause[1]{ \draw (t1) to (t3); } \mpause{ \draw (t1) to (t2); } \mpause{ \draw (t3) to (t2); } \end{scope} \end{tikzpicture} \end{tcenter} \pause\pause\pause\pause\pause There is no cycle, thus the schedule is conflict-serializable! \begin{tcenter} {\small\def\scheduleWidth{1cm} \begin{tikzpicture} \schedule{}{3}{1rV|1rZ|1rY|3wV|3wZ|2rY|2wV} \end{tikzpicture} } \end{tcenter} \end{quiz} \end{frame}