quiz10-index-sorting-solution.pdf - Name USC ID Quiz 10 B-Tree Index External Sorting(10 points 15 minutes 1[4 points Consider a B-tree with an order of

quiz10-index-sorting-solution.pdf - Name USC ID Quiz 10...

This preview shows page 1 out of 1 page.

Name: ___________________________ USC ID: ______________________ INF 551, Spring 2017 Quiz 10: B+-Tree Index & External Sorting (10 points. 15 minutes) 1. [4 points] Consider a B+-tree with an order of 2 as shown below. Note that this simplified drawing only shows the slots occupied with keys. Show the final B+-tree after inserting keys 10, 11, 12 in this order, and then removing key 20. 2. [6 points] Consider merge-sorting a file with 1000 blocks using 10 buffer pages. Assume block
Image of page 1

You've reached the end of your free preview.

Want to read the whole page?

  • Fall '14
  • Harshad number, #, Computer file, Disk sector

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture