You are a database developer. You plan to design a database solution by using SQL Server
2008. The database has a table named Sales. The Sales table contains 10 million rows.
You discover that the following query takes a long time to execute. SELECT s.sale_id, …
FROM Sales AS s JOIN Country AS c ON s.Country_id = c.Country_id AND
c.Country_name = ‘USA’ A summary of the execution plan is as shown in the following code
segment. |–Hash Match(Inner Join, HASH:([s].[Country_id]) = ([c].[Country_id]) |–Clustered
Index Scan(OBJECT:([Country].[PK_Country_Country_id] AS [c]) |–Clustered Index
Scan(OBJECT:([Sales].[PK_Sales_Sale_id] AS [s])) You need to ensure that the query
retrieves data in minimum possible time. What should you do?
A.
Modify the query to use a merge join hint.
B.
Create a nonclustered index in the Country_id column of the Sales table.
C.
Create a nonclustered index in the Country_name column of the Country table.
D.
Modify the query to use a loop join hint.