diff options
Diffstat (limited to 'chapters/sigmod23/introduction.tex')
| -rw-r--r-- | chapters/sigmod23/introduction.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/sigmod23/introduction.tex b/chapters/sigmod23/introduction.tex index befdbba..1a33c2e 100644 --- a/chapters/sigmod23/introduction.tex +++ b/chapters/sigmod23/introduction.tex @@ -3,7 +3,7 @@ Having discussed the relevant background materials, we will now turn to a discussion of our first attempt to address the limitations of dynamization in the context of one particular class of non-decomposable search problem: -indepedent random sampling. We've already discussed one representative +independent random sampling. We've already discussed one representative problem of this class, independent range sampling, and shown how it is not traditionally decomposable. This specific problem is one of several very similar types of problem, however, and in this chapter we will also @@ -21,7 +21,7 @@ problems is limited by the techniques used within databases to implement them. Existing implementations tend to sacrifice either performance, by requiring the entire result set of be materialized prior to applying Bernoulli sampling, or statistical independence. There exists techniques -for obtaining both sampling performance and indepedence by leveraging +for obtaining both sampling performance and independence by leveraging existing B+Tree indices with slight modification~\cite{olken-thesis}, but even this technique has worse sampling performance than could be achieved using specialized static sampling indices. |