信息检索课程lecture1-intro要点解析.pptVIP

Boolean queries: Exact match The Boolean retrieval model is being able to ask a query that is a Boolean expression: Boolean Queries use AND, OR and NOT to join query terms Views each document as a set of words Is precise: document matches condition or not. Perhaps the simplest model to build an IR system on Primary commercial retrieval tool for 3 decades. Many search systems you still use are Boolean: Email, library catalog, Mac OS X Spotlight * Sec. 1.3 Example: WestLaw / Largest commercial (paying subscribers) legal search service (started 1975; ranking added 1992) Tens of terabytes of data; 700,000 users Majority of users still use boolean queries Example query: What is the statute of limitations in cases involving the federal tort claims act? LIMIT! /3 STATUTE ACTION /S FEDERAL /2 TORT /3 CLAIM /3 = within 3 words, /S = in same sentence * Sec. 1.4 Example: WestLaw / Note that SPACE is disjunction, not conjunction! Long, precise queries; proximity operators; incrementally developed; not like web search Many professional searchers still like Boolean search You know exactly what you are getting But that doesn’t mean it actually works better…. Sec. 1.4 Boolean queries: More general merges Exercise: Adapt the merge for the queries: Brutus AND NOT Caesar Can we still run through the merge in time O(x+y)? * Sec. 1.3 Merging What about an arbitrary Boolean formula? (Brutus OR Caesar) AND NOT (Antony OR Cleopatra) Can we always merge in “linear” time? Linear in what? Can we do better? * Sec. 1.3 Query optimization What is the best order for query processing? Consider a query that is an AND of n terms. For each of the n terms, get its postings, then AND them together. Brutus Caesar Calpurnia 1 2 3 5 8 16 21 34 2 4 8 16 32 64 128 13 16 Query: Brutus AND Calpurnia AND Caesar * Sec. 1.3 Query optimization example Process in order of increasing freq: start with smallest set, then keep cutting further. * This is why we kept document freq. in dictionary Execute the