A schema of the car rental information system is given: Vehicle (vid, brand, model, year, no_doors, transmission); Customer (cid, name, surname, address, telephone); Rental (rid, vid, cid, eid, date); Employee (eid, name, surname, address, telephone); Additional information is given: Page on the disk = 8000 | Vehicle | = 5.000 records, 240 bytes, 20 records/page, 250 pages | Customer | = 10.000 records, 200 bytes, 40 records/page, 250 pages | Rental | = 300.000 records, 40 bytes, 200 records/page, 1500 pages | Employee| = 100 records, 200 bytes, 40 records/page, 3 pages Buffer can store 2500 pages. For the given query, determine how many pages would we read if we use sort-merge join. Π(brand, model)(σvid=123 (Vehicle ⨝vahicle.vid=rental.vid Rental)

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
icon
Related questions
Question
100%
A schema of the car rental information system is given: Vehicle (vid, brand, model, year, no_doors, transmission); Customer (cid, name, surname, address, telephone); Rental (rid, vid, cid, eid, date); Employee (eid, name, surname, address, telephone); Additional information is given: Page on the disk = 8000 | Vehicle | = 5.000 records, 240 bytes, 20 records/page, 250 pages | Customer | = 10.000 records, 200 bytes, 40 records/page, 250 pages | Rental | = 300.000 records, 40 bytes, 200 records/page, 1500 pages | Employee| = 100 records, 200 bytes, 40 records/page, 3 pages Buffer can store 2500 pages. For the given query, determine how many pages would we read if we use sort-merge join. Π(brand, model)(σvid=123 (Vehicle ⨝vahicle.vid=rental.vid Rental)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Let's assume that the following indices are now set on the schema from the previous task: - Level 2 B+ index on the attribute Vehicle.year - Hash index on the attribute Rental.date Our DBMS has the following algorithms to perform the join: - Block nested loops join - Index nested loops join Translate the following SQL query into relational algebra and find the plan that reads the fewest pages or blocks: SELECT Vehicle.brand, Vehicle.model FROM Vehicle JOIN Rental ON (Vehicle.vid = Rental.vid) WHERE Vehicle.year = 2015 AND Rental.date > ’31.12.2022’

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Analysis of Performance Measurement
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 System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education