cs186_fa07_mt1_sol 9

cs186_fa07_mt1_sol 9 - words are added one at a time in...

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

View Full Document Right Arrow Icon
Text Search Suppose we were to build an inverted index on the fol owing set of documents using a B+ tree: ford.html mustang expedition focus fonefiftey honda.html accord civic Additional y, assume that: - The index is constructed by sequential y adding documents one at a time in this order (no bulk loading): (1)ford.html, (2) toyota.html, (3) honda.html , (4) wanted.html - When considering x.html, its contents are considered sequential y. For example, for ford.html, the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: words are added one at a time in this order (no bulk loading): (a) mustang, (b) expedition, (c) focus, (d) fonefiftey-The B+ Tree structure fol ows Alternative 2 where data entries are <key, rid> pairs. Note that each document is 1 block. After ford.html’s contents are added, the inverted index looks like this: fonefiftey expedition focus ford.html … Name_________________________________________- 9 -...
View Full Document

This note was uploaded on 08/30/2009 for the course CS 186 taught by Professor Staff during the Fall '08 term at Berkeley.

Ask a homework question - tutors are online