[Solved]-Question 2 4 Marks Consider Relation R B C D E F G H Containing 10 000 000 Records Data Pa Q37251440
Question 2 (4 marks) Consider a relation R(a,b,c,d,e,f,g,h) containing 10,000,000 records, where each data page of the relation holds 10 records. R is organised as a sorted file with the search key R.a. Assume that R.a is a candidate key of R, with values lying in the range 0 to 9,999,999. For the relational algebra t^a.boa2,000,000 and a8,000,000)(R), state which of the following approaches (or combination thereof) is the most likely to be the cheapest: 1. Access the sorted file for R directly. 2. Use a clustered B+ tree index on attribute R.a. 3. Use a clustered B+ tree index on attribute R.b. 4. Use a linear hashed index on attribute R.a 5. Use a clustered B+ tree index on attributes (R.a, R.b). 6. Use a linear hashed index on attribute s (R.a, R.b). We assume that the database considers index-only plans. Index-only plans allow an index to contain all columns required to answer the query. It means that by using index-only plans, you will not have to access the data records in the file that contain the queried relations Show transcribed image text Question 2 (4 marks) Consider a relation R(a,b,c,d,e,f,g,h) containing 10,000,000 records, where each data page of the relation holds 10 records. R is organised as a sorted file with the search key R.a. Assume that R.a is a candidate key of R, with values lying in the range 0 to 9,999,999. For the relational algebra t^a.boa2,000,000 and a8,000,000)(R), state which of the following approaches (or combination thereof) is the most likely to be the cheapest: 1. Access the sorted file for R directly. 2. Use a clustered B+ tree index on attribute R.a. 3. Use a clustered B+ tree index on attribute R.b. 4. Use a linear hashed index on attribute R.a 5. Use a clustered B+ tree index on attributes (R.a, R.b). 6. Use a linear hashed index on attribute s (R.a, R.b). We assume that the database considers index-only plans. Index-only plans allow an index to contain all columns required to answer the query. It means that by using index-only plans, you will not have to access the data records in the file that contain the queried relations
Expert Answer
Answer to Question 2 (4 marks) Consider a relation R(a,b,c,d,e,f,g,h) containing 10,000,000 records, where each data page of the r… . . .
OR
