Midterm 3 Solutions 12

# You start by setting up tables for your human users

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: es to only use B- K buffers. 4. Since we’re just trying to count the various animals, we only need to store the intermediate counts in our hybrid hashing table. These are tuples of the form <animal, count> (e.g. <'cow', 6> to represent that we’ve counted six cows so far). We can store 20 of these tuples per page. Given the particular K you chose above, what’s the greatest number of different types of animals could there be such that we can hash them all in one pass? [3pt] 1,500 We can store 20*K different types of animals. 20*<question 3>= 1,500. or We also accepted 1,000 if you said 50 in Q3. We can store 20*K different types of animals. 20*<question 3> = 1,000. II. DogSquareBookGram: A SQL Success Story [13 points] This is your big break! Your b...
View Full Document

Ask a homework question - tutors are online