When a B+ tree is made up of nodes with index key entries as shown below, show the resulting structure of the B+ tree after inserting two index keys 21 and 10 in this order. b) B+ tree index structure...

Homework 11 (Maximum 60 points) Upload the homework onto Blackboard as one pdf, doc, or docx file. Due end of day (11:59 p.m.) Friday December 8, 2017 1. (30) [Index structure: B+ tree and B tree] a) When a B+ tree is made up of nodes with index key entries as shown below, show the resulting structure of the B+ tree after inserting two index keys 21 and 10 in this order. |37| |48| |60| |56| |59| |65| |71| |18| |23| |46| |48| | |60| |92| |37| | b) B+ tree index structure is said to be an improvement of B tree index structure. The most important distinction between them is that data record pointers exist in both internal and leaf nodes (i.e., blocks) for a B tree whereas only in the leaf nodes for a B+ tree. Explain why this distinction would make B+ tree a more efficient structure (in terms of index search speed) overall than a B tree. Reference: read Section 17.3.1 for B-trees. 2. (30) [Conjunctive vs. disjunctive selection] Consider a database table Person whose schema includes two columns “State” and “Income”. Assume the DBMS stores record pointers in the index records. (So, it uses the method S10 in Section 18.3.2 to process conjunctive selection.) Consider the following SQL SELECT query statements Q1: select * from Person where State = ‘Vermont’ and Income > 80000; Q2: select * from Person where State = ‘Vermont’ or Income > 80000; and discuss how the DBMS processes each query in each of the following three cases: a) Each of State and Income has an index on it. b) Only State (i.e., not Income) has an index on it. c) Neither State nor Income has an index on it. Last modified: December 1, 2017