diff options
| author | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-07-06 18:21:32 -0400 |
|---|---|---|
| committer | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-07-06 18:21:32 -0400 |
| commit | 0dc1a8ea20820168149cedaa14e223d4d31dc4b6 (patch) | |
| tree | 2bc726803cf6de6d669958b1f5a79cde59722e00 /supplementary | |
| parent | 0fff4753fac809a6ba17f428df3a041cebe692e0 (diff) | |
| download | dissertation-0dc1a8ea20820168149cedaa14e223d4d31dc4b6.tar.gz | |
updates
Diffstat (limited to 'supplementary')
| -rw-r--r-- | supplementary/nomenclature.tex | 17 |
1 files changed, 16 insertions, 1 deletions
diff --git a/supplementary/nomenclature.tex b/supplementary/nomenclature.tex index 15565a9..2846491 100644 --- a/supplementary/nomenclature.tex +++ b/supplementary/nomenclature.tex @@ -4,17 +4,32 @@ \textbf{Symbol} & \textbf{Description} \\ \hline $N_B$ & Capacity of the mutable buffer \\ \hline $s$ & Scale factor \\ \hline + $N_B$ & Buffer size \\ \hline + $\delta$ & Maximum proportion of deleted records in structure \\ \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 + $\mathscr{Q}_S(n)$ & Worst-case query cost over a single block/shard \\ \hline $I_A(n)$ & Amortized insertion cost \\ \hline $I(n)$ & Worst-case insertion cost \\ \hline $I_B(n)$ & Best-case insertion cost \\ \hline + $D(n)$ & Worst-case deletion cost \\ \hline + $D_A(n)$ & Amortized deletion cost \\ \hline + $C(n)$ & Worst-case result combination cost \\ \hline + $P(n)$ & Worst-case cost of eDSP preprocessing \\ \hline + $C_e(n)$ & Worst-case cost of eDSP result set combination \\ \hline + $R(n)$ & Worst-case number of repetitions of an IDSP \\ \hline + $\mathscr{D}(n)$ & Worst-case cost of eDSP local query generation \\ \hline $\mathcal{D}$ & Record domain \\ \hline + $\mathcal{R}$ & Search problem result domain \\ \hline + $\mathcal{Q}$ & Search problem parameter domains \\ \hline + $F$ & Search problem \\ \hline $\mathcal{I}$ & Data structure type \\ \hline $\mathscr{I}$ & Data structure instance \\ \hline + $\mathscr{L}_i$ & The $i$th level in a decomposition \\ \hline + $\mathcal{V}_i$ & The $i$th version of a decomposed structure \\ \hline + $f(n)$ & Number of blocks in an equal block size decomposition \\ \hline \end{tabular} \end{center} |