在信息检索中给定两个term的postings list进行逻辑查询最简单的算法是INTERSECT:
def intersect(p1, p2):
answer = []
i = 0;
j = 0;
while i != len(p1) and j!=len(p2):
if p1[i] == p2[j]:
answer.append(p1[i])
i = i + 1
j = j + 1
elif p1[i] < p2 [j]:
i = i + 1
else:
j = j + 1
return answer