Question: Suppose that a B+-tree index on (branch-name, branch-city) is available on relation branch. What would be the best way to handle the following selection?
Suppose that a B+-tree index on (branch-name, branch-city) is available on relation branch. What would be the best way to handle the following selection?
σ (branch-city<“Brooklyn”) ∧ (assets<5000)∧(branch-name=“Downtown”)(branch)
Step by Step Solution
3.48 Rating (174 Votes )
There are 3 Steps involved in it
Using the index we locate the first tuple having br... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
16-CS-DB (305).docx
120 KBs Word File
