diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-25 19:45:30 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-25 19:45:30 -0400 |
| commit | 7c6ef4b21e356c7c6b73a951bf27c68898f8cec9 (patch) | |
| tree | d44210b60bd44e0920fbd6cad895b651291fa2e8 /supplementary/nomenclature.tex | |
| parent | 9f730256a5526564f7db0d6f802bd0b82178731e (diff) | |
| download | dissertation-7c6ef4b21e356c7c6b73a951bf27c68898f8cec9.tar.gz | |
updates
Diffstat (limited to 'supplementary/nomenclature.tex')
| -rw-r--r-- | supplementary/nomenclature.tex | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/supplementary/nomenclature.tex b/supplementary/nomenclature.tex index 01e0d48..15565a9 100644 --- a/supplementary/nomenclature.tex +++ b/supplementary/nomenclature.tex @@ -5,10 +5,11 @@ $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)$ & Data structure construction cost from merging existing instances\\ \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-csae query cost over a single block/shard \\ \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 |