Create a secondary B+-tree (with n=4) index for the attribute salary

Can someone help me solve this question:

This question is based on the relational schema for the student management system.

The instructor relation with some sample data is shown here : Image of Relation/ Table

Create a secondary B+-tree (with n=4) index for the attribute salary. Assume the tuples are inserted in the order of staff id. [20/30 marks] Explain how the following query can be executed efficiently using the generated secondary B+-tree index. [10/30 marks] SELECT * FROM instructor WHERE salary= '88000';

https://stackoverflow.com/questions/66609748/create-a-secondary-b-tree-with-n-4-index-for-the-attribute-salary March 13, 2021 at 11:06AM