{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Midterm 3 Solutions 12

# Well choose k by asking the question what is the

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: (8000 data pages / 100 buffer pages), so they’ll fit nicely into the ReHash stage. 2. How large will the average partition be as they enter the ReHash stage, in pages? [3pt] 80. Calculation shown above. Later, you need to count how many each type of animal you have, for tax reasons. You decide to use hash aggregation with hybrid hashing. For the next 2 questions, assume you have 150 buffer pages and 40,000 animals. 3. In order to do hybrid hashing, we need to reserve K pages for the in- memory hash table. We’ll choose K by asking the question: What is the maximum K such that we can hash all the animals in 2 passes, using just B- K buffers? In other words, we want to ensure that all the animals will be hashed...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern