Questions
Questions

INFO20003_2025_SM2 Exam: Database Systems (INFO20003_2025_SM2)- Requires Respondus LockDown Browser

Single choice

Single Relation Plan C What would happen if our query changed and became:  SELECT hotspotID FROM hotspot WHERE postcode = 2600 AND establishmentYear > 2020 AND establishmentYear < 2022; Assuming that the unclustered B+tree index on establishmentYear from the previous question is the only index available, would the cost of the best plan change? 

Options
A.Yes, because the RF value will change leading to an expensive index scan
B.No, eventually the result size will stay the same.
C.No, the best plan is still the same.
View Explanation

View Explanation

Verified Answer
Please login to view
Step-by-Step Analysis
Let's restate the scenario and options to begin a careful evaluation of how the plan might behave with the given conditions. Question restatement: We have a query that selects hotspotID from hotspot where postcode = 2600 AND establishmentYear > 2020 AND establishmentYear < 2022. The only available index is an unclustered B+tree on establishmentYear. With this setup, would the cost of the best plan change when the query is modified as shown?" Option 1: Yes, because the RF value will change leading to an expensive index scan - This claim hinges on the idea that the row fraction (RF) or selectivity changes in a way that would push the optimizer to choose a more expensive index scan. However, since the only index available is still the unclustered index on establishmentYear, the fundamental access method available to the optimizer remains the same: use the index to locate rows......Login to view full explanation

Log in for full answers

We've collected over 50,000 authentic exam questions and detailed explanations from around the globe. Log in now and get instant access to the answers!

Similar Questions

Query Optimisation Plan 2  Compute the following results for the below Plan 2:  The result size of the selection on vendor in pages (marked as 'A' in the diagram) The result size of the child join in pages (marked as 'B' in the diagram) The cost of the selection on vendor in I/Os (note this also accounts for the index access cost as well) (marked as 'C' in the diagram) The cost of the child join in I/Os (marked as 'D' in the diagram) The cost of the parent join in I/Os (marked as 'E' in the diagram)   Figure 3.3.2: PLAN 2. 1: The result size of the selection on Vendor in PAGES (marked as 'A' in the diagram) 2: The result size of the child join in PAGES (marked as 'B' in the diagram) 3: The cost of the selection on Vendor in I/Os (note this also accounts for the index access cost as well) (marked as 'C' in the diagram) 4: The cost of the child join in I/Os (marked as 'D' in the diagram) 5: The cost of the parent join in I/Os (marked as 'E' in the diagram)

Query Optimisation Plan 1  Compute the following results for the below Plan 1:  The result size of the child join in pages (marked as 'A' in the diagram) The cost of the child join in I/Os (marked as 'B' in the diagram).  The cost of the parent join in I/Os (marked as 'C' in the diagram)     Figure 3.3.1: PLAN 1. 1: The result size of the child join in PAGES (marked as 'A' in the diagram) 2: The cost of the child join in I/Os (marked as 'B' in the diagram) 3: The cost of the parent join in I/Os (marked as 'C' in the diagram)

Single Relation Plan B Compute the estimated cost of plan alternatives, assuming that an unclustered B+tree index on (establishmentYear) is the only index available. Suppose there are 10 index pages.  Give the lowest (estimated) cost in I/Os after considering all access methods available.  Round up any decimals to the nearest integer (e.g., 3.3 rounds up to 4).

Single Relation Plan A Compute the estimated result size for the query, and the reduction factor of each filter.   1: RF(establishmentYear) 2: RF(postcode) 3: Result Size (tuples)

More Practical Tools for Students Powered by AI Study Helper

Join us and instantly unlock extensive past papers & exclusive solutions to get a head start on your studies!