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 ask: 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 rea the fewest pages or blocks: SELECT Skiis.model, Skiis.length FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid) WHERE Skiis brand - 'Flan' 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 ask: 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 rea the fewest pages or blocks: SELECT Skiis.model, Skiis.length FROM Skiis JOIN Purchase ON (Skiis.sid = Purchase.sid) WHERE Skiis brand - 'Flan' AND Purchase date > '31 12 2023'
Chapter2: Database Design Fundamentals
Section: Chapter Questions
Problem 11RQ
Related questions
Question
![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%2Ff560e125-6ff2-46eb-9cdc-82e527c3cdfb%2Fzfratho_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
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 2 images
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
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781305627482
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781285196145
Author:
Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:
Cengage Learning
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781305627482
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781285196145
Author:
Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:
Cengage Learning
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781305971776
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Principles of Information Systems (MindTap Course…
Computer Science
ISBN:
9781285867168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning