To optimize disk /O cost, if you frequently have to access the pages of a file in sequential order. How would you lay those pages on disk? Consider the architecture of a typical modern disk consisting of platters, tracks, cylinders e
To optimize disk /O cost, if you frequently have to access the pages of a file in sequential order. How would you lay those pages on disk? Consider the architecture of a typical modern disk consisting of platters, tracks, cylinders e
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
Problem 27: a- To optimize disk /O cost, if you frequently have to access the pages of a file in sequential order. How would you lay those pages on disk? Consider the architecture of a typical modern disk consisting of platters, tracks, cylinders etc. b- In terms of what the disk has to do for each, what is the difference ‘between random and sequential /O? - To improve the performance of the query, choose an index configuration? Briefly justify your answer. SELECT * FROM employee WHERE Name = ‘Julien’ AND workingHours > 10 > Choose one and explain briefly why . - A hash index on < workingHours > . - An unclustered tree index on < workingHours > . -An unclustered tre index on . A clustered tree index on < workingHours, Name>
![Problem 27:
a- To optimize disk I/O cost, if you frequently have to access the
pages of a file in sequential order. How would you lay those pages
on disk? Consider the architecture of a typical modern disk
consisting of platters, tracks, cylinders etc.
b- In terms of what the disk has to do for each, what is the difference
between random and sequential I/O?
c- To improve the performance of the query, choose an index
configuration? Briefly justify your answer.
SELECT *
FROM employee
WHERE Name = 'Julien' AND workingHours > 10
Choose one and explain briefly why
.- A hash index on < workingHours >
- An unclustered tree index on < workingHours >
-An unclustered tree index on <Name>
A clustered tree index on < workingHours, Name>](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3e3fafef-f29b-4fe8-8b84-154d4084b786%2Fbe492cf2-29ee-4059-b1ab-a94ccc212301%2Fok86mq2_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Problem 27:
a- To optimize disk I/O cost, if you frequently have to access the
pages of a file in sequential order. How would you lay those pages
on disk? Consider the architecture of a typical modern disk
consisting of platters, tracks, cylinders etc.
b- In terms of what the disk has to do for each, what is the difference
between random and sequential I/O?
c- To improve the performance of the query, choose an index
configuration? Briefly justify your answer.
SELECT *
FROM employee
WHERE Name = 'Julien' AND workingHours > 10
Choose one and explain briefly why
.- A hash index on < workingHours >
- An unclustered tree index on < workingHours >
-An unclustered tree index on <Name>
A clustered tree index on < workingHours, Name>
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 4 steps
![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