diff options
| author | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-06-01 13:15:52 -0400 |
|---|---|---|
| committer | Douglas B. Rumbaugh <doug@douglasrumbaugh.com> | 2025-06-01 13:15:52 -0400 |
| commit | cd3447f1cad16972e8a659ec6e84764c5b8b2745 (patch) | |
| tree | 5a50b6e8a99646e326b2c41714f50e4f7dee64d0 /chapters/sigmod23/examples.tex | |
| parent | 6354e60f106a89f5bf807082561ed5efd9be0f4f (diff) | |
| download | dissertation-cd3447f1cad16972e8a659ec6e84764c5b8b2745.tar.gz | |
Julia updates
Diffstat (limited to 'chapters/sigmod23/examples.tex')
| -rw-r--r-- | chapters/sigmod23/examples.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/chapters/sigmod23/examples.tex b/chapters/sigmod23/examples.tex index 38df04d..4e7f9ac 100644 --- a/chapters/sigmod23/examples.tex +++ b/chapters/sigmod23/examples.tex @@ -25,7 +25,7 @@ number of shards involved in a reconstruction using either layout policy is $\Theta(1)$ using our framework, this means that we can perform reconstructions in $B_M(n) \in \Theta(n)$ time, including tombstone cancellation. The total weight of the structure can also be calculated -at no time when it is constructed, allows $W(n) \in \Theta(1)$ time +at no time cost when it is constructed, allows $W(n) \in \Theta(1)$ time as well. Point lookups over the sorted data can be done using a binary search in $L(n) \in \Theta(\log_2 n)$ time, and sampling queries require no pre-processing, so $P(n) \in \Theta(1)$. The mutable buffer can be |