CS267
Chris Pollett
Sep. 10, 2012
nextPhrase(t[1],t[2], .., t[n], position) { v:=position for i = 1 to n do v:= next(t[i], v) if v == infty then // infty represents after the end of the posting list return [infty, infty] u := v for i := n-1 downto 1 do u := prev(t[i],u) if(v-u == n - 1) then return [u, v] else return nextPhrase(t[1],t[2], .., t[n], u) }
u := -infty while u < infty do [u, v] := nextPhrase(t[1],t[2], .., t[n], u) if( u != infty) then report the interval [u, v]
Which of the following is true?
function next(t, current) { // P[][] = array of posting list array // l[] = array of length of these posting lists static c = array(); //last positions for terms if(l[t] == 0 || P[t][l[t]] <= current) then return infty; if( P[t][1] > current) then c[t] := 1; return P[t][c[t]]; if( c[t] > 1 && P[t][c[t] - 1] <= current ) do low := c[t] -1; else low := 1; jump := 1; high := low + jump; while (high < l[t] && P[t][high] <= current) do low := high; jump := 2*jump; high := low + jump; if(high > l[t]) then high := l[t]; c[t] = binarySearch(t, low, high, current) return P[t][c[t]]; }
The book gives a nice analysis of the runtime returning all exact phrase matches when using this algorithm and shows it to be: `O(n cdot l cdot log (L/l))`
When working with documents there are several common statistics which people typically keep track of:
Also, when working with document-oriented indexes it is common to support coarser grained methods in our ADT, such as firstDoc(`t`), lastDoc(`t`), nextDoc(`t`, `mbox(current)`), and prevDoc(`t`, `mbox(current)`). The idea of a method like nextDoc, is that it returns the first document with the term `t` after `current` in the corpus. i.e., we don't care about position in the document with this method.