Answered step by step
Verified Expert Solution
Question
1 Approved Answer
TAKES(SID,CID,GRADE) Given a join query: SELECT STUDENT.NAME, TAKES.CID, GRADE FROM STUDENT, TAKES WHERE STUDENT.SID = TAKES.SID Known information: 1. There is clustered indexing built on
TAKES(SID,CID,GRADE) Given a join query: SELECT STUDENT.NAME, TAKES.CID, GRADE FROM STUDENT, TAKES WHERE STUDENT.SID = TAKES.SID Known information: 1. There is clustered indexing built on SID of STUDENT table and the STUDENT table is sorted based on the SID attribute. 2. There is no indexing built on the TAKES table, but the TAKES table is also sorted by the SID attribute. 3. The memory can hold 5 pages. 4. The STUDENT table has 100 pages. 5. The TAKES table has 1000 pages. 6. SID is a foreign key of the Takes table that reference the SID of the Student table. Using plain english to describe three different algorithms to implement the join. Join Algorithm 1 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Enter your answer here Join Algorithm 2 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Join Algorithm 3 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Enter your answer here Which of the above Join Algorithm will be more efficient for this scenario? Please explain the reasons (5pt) Enter your answer here TAKES(SID,CID,GRADE) Given a join query: SELECT STUDENT.NAME, TAKES.CID, GRADE FROM STUDENT, TAKES WHERE STUDENT.SID = TAKES.SID Known information: 1. There is clustered indexing built on SID of STUDENT table and the STUDENT table is sorted based on the SID attribute. 2. There is no indexing built on the TAKES table, but the TAKES table is also sorted by the SID attribute. 3. The memory can hold 5 pages. 4. The STUDENT table has 100 pages. 5. The TAKES table has 1000 pages. 6. SID is a foreign key of the Takes table that reference the SID of the Student table. Using plain english to describe three different algorithms to implement the join. Join Algorithm 1 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Enter your answer here Join Algorithm 2 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Join Algorithm 3 Description (Give the name of the algorithm, and a few sentences to describe the algorithm). (3pt) Enter your answer here Which of the above Join Algorithm will be more efficient for this scenario? Please explain the reasons (5pt) Enter your answer here
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