IR-part1

Long precise queries proximity operators incrementally

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5 32 8 64 13 Brutus 34 34 Caesar 128 21 If the list lengths are x and y, the merge takes O(x+y) operations. Crucial: postings sorted by docID. 32 Introduc)on to Informa)on Retrieval Intersec*ng two pos*ngs lists (a “merge” algorithm) 33 Introduc)on to Informa)on Retrieval Introduc*on to Informa(on Retrieval Query processing with an inverted index Introduc)on to Informa)on Retrieval Introduc*on to Informa(on Retrieval The Boolean Retrieval Model & Extended Boolean Models Introduc)on to Informa)on Retrieval Sec. 1.3 Boolean queries: Exact match §༊  The Boolean retrieval model is being able to ask a query that is a Boolean expression: §༊  Boolean Queries are queries using AND, OR and NOT to join query terms §༊  Views each document as a set of words §༊  Is precise: document matches condi*on or not. §༊  Perhaps the simplest model to build an IR system on §༊  Primary...
View Full Document

Ask a homework question - tutors are online