\begin{center}
\begin{tabular}{|l l|}
	\hline
	\textbf{Symbol} & \textbf{Description} \\ \hline
	$N_B$ & Capacity of the mutable buffer \\ \hline
	$s$   & Scale factor \\ \hline
	$B(n)$ & Data structure construction cost from unsorted records \\ \hline
	$B_M(n, k)$ & Data structure construction cost from merging $k$ existing instances\\ \hline
	$L(n)$ & Point-lookup cost \\ \hline
	$\mathscr{Q}(n)$ & Worst-case query cost over entire structure  \\ \hline
	$\mathscr{Q}_S(n)$ & Worst-case query cost over a single block/shard \\ \hline
	$\mathscr{Q}_B(n)$ & Best-case query cost over entire structure \\ \hline
	$I_A(n)$ & Amortized insertion cost \\ \hline
	$I(n)$ & Worst-case insertion cost \\ \hline
	$I_B(n)$ & Best-case insertion cost \\ \hline
	$\mathcal{D}$ & Record domain \\ \hline
	$\mathcal{I}$ & Data structure type \\ \hline
	$\mathscr{I}$ & Data structure instance \\ \hline
\end{tabular}
\end{center}
