From cd3447f1cad16972e8a659ec6e84764c5b8b2745 Mon Sep 17 00:00:00 2001 From: "Douglas B. Rumbaugh" Date: Sun, 1 Jun 2025 13:15:52 -0400 Subject: Julia updates --- chapters/sigmod23/examples.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'chapters/sigmod23/examples.tex') 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 -- cgit v1.2.3