Q8. Assume we have a table called sales with columns (id, rental_date, inventory_id, customer_id) and the table has a clustered innoDB index on id (primary key) and a B+ tree index on (rental_date, inventory_id). A clustered index in innoDB contains the entire row (all columns) in its leaf nodes while a B+ tree index in innoDB contains only the indexed columns (rental_date, inventory_id) and the primary key (id) in its leaf node. How many index lookups (index access) will the following query perform?

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

If you have a computer file with 2 million records and utilize a B+ tree index with a tree order of 200, what is the maximum number of nodes you may need to access?

With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the root node) that must be fetched in order to satisfy the following query: “Get all records with a search key greater than or equal to 7 and less than 15” is ________

3. How do you create an index on a table in a relational database, and what is the significance of indexing in terms of query performance?

Q9.Which of the following indexes includes (covers) all the data that is necessary for a query?*1 pointCovering indexMulticolumn indexesClustered indexesNon-clustered indexes