We have a database file with six million pages (6,000,000 pages), and we want to sort it using external merge sort. Assu
Posted: Sun May 15, 2022 8:34 am
We have a database file with six million pages (6,000,000
pages), and we want to sort it using external merge sort. Assume
that the DBMS is not using double buffering or blocked I/O, and
that it uses quicksort for in-memory sorting.
Assume that the DBMS
has six buffers.
How many runs will you produce in the second pass
(Pass #1)?
Reference:
1,000,000
200,000
1,000,001
200,001
3,334
Reference to the above question:
Refer to the previous question.
How many passes does the DBMS need to perform in order to sort
the file completely?
(Note: an online log calculator can be found
at https://www.calculator.net/log-calculator.html (Links
to an external site.))
Group of answer choices
6
11
12
13
pages), and we want to sort it using external merge sort. Assume
that the DBMS is not using double buffering or blocked I/O, and
that it uses quicksort for in-memory sorting.
Assume that the DBMS
has six buffers.
How many runs will you produce in the second pass
(Pass #1)?
Reference:
1,000,000
200,000
1,000,001
200,001
3,334
Reference to the above question:
Refer to the previous question.
How many passes does the DBMS need to perform in order to sort
the file completely?
(Note: an online log calculator can be found
at https://www.calculator.net/log-calculator.html (Links
to an external site.))
Group of answer choices
6
11
12
13