1. Query processing Suppose we have the following relational schema: Students (sid:integer, name:string, gpa:real) Courses (course:string, credits:integer) Enrolled (sid:integer, course:string, semester:string) Also suppose there are hash indexes on Students.sid, Enrolled.sid, and Enrolled.course. Describe how you would compute each operation in the query execution tree below. For each operation provide an algorithm name or write "on the fly". Indicate whether the results of the operation will b materialized to disk or pipelined to the next operation. Be sure to indicate where indexes are used. O TT name Enrolled gpa>3 sid=sid course-CISC437 Students
1. Query processing Suppose we have the following relational schema: Students (sid:integer, name:string, gpa:real) Courses (course:string, credits:integer) Enrolled (sid:integer, course:string, semester:string) Also suppose there are hash indexes on Students.sid, Enrolled.sid, and Enrolled.course. Describe how you would compute each operation in the query execution tree below. For each operation provide an algorithm name or write "on the fly". Indicate whether the results of the operation will b materialized to disk or pipelined to the next operation. Be sure to indicate where indexes are used. O TT name Enrolled gpa>3 sid=sid course-CISC437 Students
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
12
Transcribed Image Text:1. Query processing
Suppose we have the following relational schema:
Students(sid:integer, name:string, gpa:real)
Courses (course:string, credits:integer)
Enrolled (sid:integer, course:string, semester:string)
Also suppose there are hash indexes on Students.sid, Enrolled.sid, and Enrolled.course.
Describe how you would compute each operation in the query execution tree below. For each operation,
provide an algorithm name or write “on the fly". Indicate whether the results of the operation will be
materialized to disk or pipelined to the next operation. Be sure to indicate where indexes are used.
name
Enrolled
Ogpa>3
sid=sid
course=CISC437 Students
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education