1. PART (40%): 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 Systems: Design, Implementation, & Management
11th Edition
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:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Chapter5: Advanced Data Modeling
Section: Chapter Questions
Problem 8RQ: According to the data model, is it required that every entity instance in the PRODUCT table be...
icon
Related questions
Question

1. PART (40%): 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
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Enhanced ER Model
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database Systems: Design, Implementation, & Manag…
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