Lexicon-based inversion
		¡ Partition inversion as |I|/|M| = k smaller problems l build 1/k of inverted index on each pass l (e.g., a-b, b-c, …, y-z) l Tuned to fit amount of main memory in machine l Just remember boundary words ¡ Can pair with disk strategy l Create k temporary files and write tuples (t,d,fd,t) for each partition on first pass l Each second pass builds index from temporary file