Question: Question 4: Buffer Pools . . . . . . . . . . . . . . . . . . . . .

Question 4: Buffer Pools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [10 points] Check True or False for each of the following statements. (a) [2 points] 2 T 2 F It is not possible for the DBMS to pre-fetch pages into the buffer pool unless those pages are stored contiguously on disk. (b) [2 points] 2 T 2 F The CLOCK buffer pool replacement policy always selects the least-recently used page since the last sweep. (c) [2 points] 2 T 2 F The DBMS can write dirty pages to disk even if they are not selected for eviction only if they are not pinned. (d) [2 points] 2 T 2 F If the DBMS uses a counter to track the number of threads that have pinned a page, it does not need to also use a separate boolean flag to track whether that page is dirty. (e) [2 points] 2 T 2 F Maintaining separate buffer pools for index pages and table heap pages will prevent index pages from being swapped out of memory due to sequential flooding on table scans. Question 4: Buffer Pools . . . . . . . .

Check 'T'rue or 'F'alse for each of the following statements. (a) [2 points] TF It is not possible for the DBMS to pre-fetch pages into the buffer pool unless those pages are stored contiguously on disk. (b) [2 points] TF The CLOCK buffer pool replacement policy always selects the least-recently used page since the last sweep. (c) [2 points] TF The DBMS can write dirty pages to disk even if they are not selected for eviction only if they are not pinned. (d) [2 points] TF If the DBMS uses a counter to track the number of threads that have pinned a page, it does not need to also use a separate boolean flag to track whether that page is dirty. (e) [2 points] TF Maintaining separate buffer pools for index pages and table heap pages will prevent index pages from being swapped out of memory due to sequential flooding on table scans

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!