Data base query processing concerns how to reduce a I/O time for relational algebra operations such as selection, projection and join.
Let's discuss if the buffer space available in a main memory can impact I/O time (talking points: if it does, how and why it does.
If not, why it does not. Does it impact all the time or sometimes?
Pros and cons of using large buffer versus small buffer spaces? etc).
Discuss if a data is clustered or non clustered impacts I/O time.
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.
• the buffer space available in a main memory can impact I/O time
– first we must go back to the defition of I/O time
– in slide, there is a defintion : ” I/O costs dominate == cost of sorting
algorithm is measured in the number of page transfers ”
– we have these total cost formula where :
– M = number of main memory page buffers
– F = number of pages in file to be sorted
∗ simple sort algorithm :...
This is only a preview of the solution. Please use the purchase button to see the entire solution