From b8ae600d0d139fa76f8350f13f058b2cb795b692 Mon Sep 17 00:00:00 2001
From: "Douglas B. Rumbaugh" <doug@douglasrumbaugh.com>
Date: Sun, 1 Jun 2025 15:09:25 -0400
Subject: more updates

---
 chapters/beyond-dsp.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'chapters/beyond-dsp.tex')

diff --git a/chapters/beyond-dsp.tex b/chapters/beyond-dsp.tex
index 73f8174..222dd14 100644
--- a/chapters/beyond-dsp.tex
+++ b/chapters/beyond-dsp.tex
@@ -53,7 +53,7 @@ that can be supported by our dynamization technique.
 
 \subsection{Extended Decomposability}
 \label{ssec:edsp}
-As discussed in Chapter~\cite{chap:background}, the standard query model
+As discussed in Chapter~\ref{chap:background}, the standard query model
 used by dynamization techniques requires that a given query be broadcast,
 unaltered, to each block within the dynamized structure, and then that
 the results from these identical local queries be efficiently mergeable
@@ -1533,7 +1533,7 @@ points for each node. This structure can answer $k$-NN queries in
 $\Theta(k \log n)$ time.
 
 Our dynamized query procedure is implemented based on
-Algorithm~\cite{alg:idsp-knn}, though using delete tagging instead of
+Algorithm~\ref{alg:idsp-knn}, though using delete tagging instead of
 tombstones. VPTree doesn't support efficient point lookups, and so to
 work around this we add a hash map to each shard, mapping each record to
 its location in storage, to ensure that deletes can be done efficiently
-- 
cgit v1.2.3

