Efficient Approximate Search on String CollectionsPart I.ppt

* * * * How many lists are treated as long lists? * Length Filtering Ed(s,t) ≤ 2 s: t: Length: 19 Length: 10 By length only! * Positional Filtering a b a b Ed(s,t) ≤ 2 s t (ab,1) (ab,12) * Combine filters with list-merging algorithms [LLL08] * A filter tree Variable-length grams (VGRAM) [LWY07,YWL08] * Next… # of common grams = 1 2-grams - 3-grams? Query: “shtick”, ED(shtick, ?)≤1 id strings 0 1 2 3 4 rich stick stich stuck static 3-grams ati ich ick ric sta sti stu tat tic tuc uck tic ick sht hti tic ick 4 2 4 1 2 0 1 0 3 4 1 3 4 2 3 id strings 0 1 2 3 4 rich stick stich