question archive Consider a dense unclustered B+ tree index on plD in the Purchase table, and a sparse clustered index on CID in the Customer table
Consider a dense unclustered B+ tree index on plD in the Purchase table, and a sparse clustered index on CID in the Customer table
Subject:MathPrice: Bought3
Consider a dense unclustered B+ tree index on plD in the Purchase table, and a sparse clustered index on CID in the Customer table. For each index, what is the height and the size of the tree? How long does it take to fetch a single record with a particular key value using these indexes? How long would it take to fetch all, say, 100 records matching a particular did in the case of the second index? (You may assume 80% occupancy ratio for the index nodes, and 100% for the underlying table.)
