Intersection algorithm, and skip pointers When searching a two-word query, the following two postings lists are returned from the inverted index:

[2, 13, 18, 23, 45, 78, 88, 90, 123, 178, 245, 269, 290, 313, 389, 390]

[2, 313]

1. List all the comparison pairs when using the standard postings lists

2. To speed up the intersection between the postings lists, skip pointers are considered to add to the postings listings. Suppose the skip length is (P is the length of the postings list)

a. Add the skip pointers to the first postings list

b. After the skip pointers are added to the first postings list, list all the comparison pairs