Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider the relations Sailors (Sid, name, rating, age), Reserves (Sid, Bid, Price) (keys are underlined). One disk page can accommodate 30 tuples from the Sailors
Consider the relations Sailors (Sid, name, rating, age), Reserves (Sid, Bid, Price) (keys are underlined). One disk page can accommodate 30 tuples from the Sailors relations or 60 tuples from the Reserves relation. Given that there are 150,000 sailors and 600,000 reservations. What is the estimated I/O cost for the following scenarios? Use alternative 2. Assume one I/O is needed to retrieve a hash data entry and three I/Os are needed to retrieve a B+-tree data entry. Ignore the cost of writing out the results. 3) (5 points) Index Nested-loop join: Clustered Hash-index on Sid of Reserves (Reserves is inner) 4) (5 points) Index Nested-loop join: Unclustered Hash-index on Sid of Reserves (Reserves is inner)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started