Database Questions: will give thumbs up if both questions are
answered.
Q1:
Database Questions Will Give Thumbs Up If Both Questions Are Answered Q1 Q2 This Question Refers To The Q1 Question 1 (30.22 KiB) Viewed 80 times
Q2: This question refers to the Q1 question above
Database Questions Will Give Thumbs Up If Both Questions Are Answered Q1 Q2 This Question Refers To The Q1 Question 2 (19.42 KiB) Viewed 80 times
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)? 200,000 O 1,000,000 1,000,001 3,334 O 200,001
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 ) 13 11 10 6 12
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!