1. PART Evaluation and optimization: A schema of the ski shop information system is given: Customer (cid, name, surname, address, telephone); Employee (eid, name, surname, address, telephone); Purchase (pid, sid, cid, eid, date); Skiis (sid, brand, model, length, hardness) Additional information is given: | Customer] =150 pages, 40 records/page | Employee | = 2 pages, 40 records/page | Purchase | = 2000 pages, 100 records/page | Skiis | = 250 pages, 30 records/page Buffer can store up to 2500 pages. Let's assume that the following indices are now set on the schema from the previous task: Level 2 B+ index on the attribute Purchase.date Hash index on the attribute Skiis.sid - Our DBMS has the following algorithms to perform the join: - Hash join - Index nested loops join - Sort-merge join Translate the following SQL query into relational algebra and find the plan that reads the fewest pages or blocks: SELECT Skiis.model, Skiis.length FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid) WHERE Skiis.brand = 'Elan' AND Purchase.date > '31.12.2023'
1. PART Evaluation and optimization: A schema of the ski shop information system is given: Customer (cid, name, surname, address, telephone); Employee (eid, name, surname, address, telephone); Purchase (pid, sid, cid, eid, date); Skiis (sid, brand, model, length, hardness) Additional information is given: | Customer] =150 pages, 40 records/page | Employee | = 2 pages, 40 records/page | Purchase | = 2000 pages, 100 records/page | Skiis | = 250 pages, 30 records/page Buffer can store up to 2500 pages. Let's assume that the following indices are now set on the schema from the previous task: Level 2 B+ index on the attribute Purchase.date Hash index on the attribute Skiis.sid - Our DBMS has the following algorithms to perform the join: - Hash join - Index nested loops join - Sort-merge join Translate the following SQL query into relational algebra and find the plan that reads the fewest pages or blocks: SELECT Skiis.model, Skiis.length FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid) WHERE Skiis.brand = 'Elan' AND Purchase.date > '31.12.2023'
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
Please translate the following SQL query into relational algebra and find the plan that reads the fewest pages or blocks:
![1. PART
Evaluation and optimization:
A schema of the ski shop information system is given:
Customer (cid, name, surname, address, telephone);
Employee (eid, name, surname, address, telephone);
Purchase (pid, sid, cid, eid, date);
Skiis (sid, brand, model, length, hardness)
Additional information is given:
|Customer] =150 pages, 40 records/page
| Employee | = 2 pages, 40 records/page
| Purchase | = 2000 pages, 100 records/page
|Skiis | = 250 pages, 30 records/page
Buffer can store up to 2500 pages.
Let's assume that the following indices are now set on the schema from the previous
task:
Level 2 B+ index on the attribute Purchase.date
Hash index on the attribute Skiis.sid
-
Our DBMS has the following algorithms to perform the join:
Hash join
- Index nested loops join
Sort-merge join
Translate the following SQL query into relational algebra and find the plan that reads
the fewest pages or blocks:
SELECT Skiis.model, Skiis.length
FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid)
WHERE Skiis.brand = 'Elan' AND Purchase.date > '31.12.2023'](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ffb4074fd-9e3f-45a1-be46-9ca60cf326e6%2F2233b2c9-c6da-4fbc-a7dd-462c4bb4ea7a%2Fw6sks4i_processed.png&w=3840&q=75)
Transcribed Image Text:1. PART
Evaluation and optimization:
A schema of the ski shop information system is given:
Customer (cid, name, surname, address, telephone);
Employee (eid, name, surname, address, telephone);
Purchase (pid, sid, cid, eid, date);
Skiis (sid, brand, model, length, hardness)
Additional information is given:
|Customer] =150 pages, 40 records/page
| Employee | = 2 pages, 40 records/page
| Purchase | = 2000 pages, 100 records/page
|Skiis | = 250 pages, 30 records/page
Buffer can store up to 2500 pages.
Let's assume that the following indices are now set on the schema from the previous
task:
Level 2 B+ index on the attribute Purchase.date
Hash index on the attribute Skiis.sid
-
Our DBMS has the following algorithms to perform the join:
Hash join
- Index nested loops join
Sort-merge join
Translate the following SQL query into relational algebra and find the plan that reads
the fewest pages or blocks:
SELECT Skiis.model, Skiis.length
FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid)
WHERE Skiis.brand = 'Elan' AND Purchase.date > '31.12.2023'
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education