diff options
Diffstat (limited to 'chapters/sigmod23')
| -rw-r--r-- | chapters/sigmod23/background.tex | 4 | ||||
| -rw-r--r-- | chapters/sigmod23/framework.tex | 2 | ||||
| -rw-r--r-- | chapters/sigmod23/introduction.tex | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/chapters/sigmod23/background.tex b/chapters/sigmod23/background.tex index d600c27..88f2585 100644 --- a/chapters/sigmod23/background.tex +++ b/chapters/sigmod23/background.tex @@ -114,7 +114,7 @@ of problems that will be directly addressed within this chapter. \subsection{Algorithmic Solutions} Relational database systems often have native support for IQS using -SQL's \texttt{TABLESAMPLE} operator~\cite{postgress-doc}. However, the +SQL's \texttt{TABLESAMPLE} operator~\cite{postgres-doc}. However, the algorithms used to implement this operator have significant limitations and do not allow users to maintain statistical independence of the results without also running the query to be sampled from in full. Thus, users must @@ -137,7 +137,7 @@ in full anyway before returning only some of the results.\footnote{ For performance, the statistical guarantees can be discarded and systematic or block sampling used instead. Systematic sampling considers only a fraction of the rows in the table being sampled from, following -some particular pattern~\cite{postgress-doc}, and block sampling samples +some particular pattern~\cite{postgres-doc}, and block sampling samples entire database pages~\cite{db2-doc}. These allow for query performance to be decoupled from data size, but tie a given record's inclusion in the sample set directly to its physical storage location, which can introduce diff --git a/chapters/sigmod23/framework.tex b/chapters/sigmod23/framework.tex index 804194b..d51c2cb 100644 --- a/chapters/sigmod23/framework.tex +++ b/chapters/sigmod23/framework.tex @@ -29,7 +29,7 @@ more efficient query process if we abandon the DSP model and consider a slightly more complicated procedure. First, we'll define the IQS problem in terms of the notation and concepts -used in Chapter~\cite{chap:background} for search problems, +used in Chapter~\ref{chap:background} for search problems, \begin{definition}[Independent Query Sampling Problem] Given a search problem, $F$, a query sampling problem is function diff --git a/chapters/sigmod23/introduction.tex b/chapters/sigmod23/introduction.tex index 1a33c2e..8f0635d 100644 --- a/chapters/sigmod23/introduction.tex +++ b/chapters/sigmod23/introduction.tex @@ -29,7 +29,7 @@ achieved using specialized static sampling indices. Thus, we decided to attempt to apply a Bentley-Saxe based dynamization technique to these data structures. In this chapter, we discuss our approach, which addresses the decomposability problems discussed in -Section~\cite{ssec:background-irs}, introduces two physical mechanisms +Section~\ref{ssec:decomp-limits}, introduces two physical mechanisms for support deletes, and also introduces an LSM-tree inspired design space to allow for performance tuning. The results in this chapter are highly specialized to sampling problems, however they will serve as a |