Buffer management in DBMS Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to identify the main purpose of buffer management in a DBMS.

DBMS Theory

Buffer management is responsible for [1] data between disk and main memory.

Drag options to blanks, or click blank then click option'

Aindexing

Bdeleting

Cencrypting

Dtransferring

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing buffer management with data deletion or encryption.

Thinking buffer management creates indexes.

Buffer management handles transferring data between disk storage and main memory to improve access speed.

2fill in blank

medium

Complete the code to describe the buffer pool in DBMS.

DBMS Theory

The buffer pool is a [1] area in main memory that stores pages read from disk.

Drag options to blanks, or click blank then click option'

Apermanent

Btemporary

Cbackup

Dcompressed

Attempts:

3 left

💡 Hint

Common Mistakes

Thinking the buffer pool is permanent storage.

Confusing buffer pool with backup storage.

The buffer pool is a temporary memory area used to hold disk pages for quick access.

3fill in blank

hard

Fix the error in the statement about page replacement policy.

DBMS Theory

The [1] policy removes the page that has been used most recently.

Drag options to blanks, or click blank then click option'

AMRU

BFIFO

CLRU

DClock

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing LRU with MRU.

Assuming FIFO removes the most recently used page.

MRU (Most Recently Used) policy removes the page used most recently, unlike LRU which removes the least recently used.

4fill in blank

hard

Fill both blanks to complete the buffer replacement condition.

DBMS Theory

A page is replaced if it is [1] and [2] in the buffer pool.

Drag options to blanks, or click blank then click option'

Aunreferenced

Bdirty

Cclean

Dreferenced

Attempts:

3 left

💡 Hint

Common Mistakes

Choosing referenced pages for replacement.

Replacing dirty pages without writing them back.

Pages that are unreferenced and clean (not modified) are good candidates for replacement.

5fill in blank

hard

Fill all three blanks to complete the buffer management dictionary comprehension.

DBMS Theory

buffer_dict = {{ [1]: [2] for page, status in pages.items() if status [3] 'clean' }}

Drag options to blanks, or click blank then click option'

Apage

Bstatus

C==

D!=

Attempts:

3 left

💡 Hint

Common Mistakes

Using '!=' instead of '==' in the condition.

Swapping key and value in the dictionary comprehension.

This comprehension creates a dictionary of pages with their status only if the status is 'clean'.

Practice

1. What is the main purpose of buffer management in a database system?

easy

A. To temporarily store data pages in memory for faster access

B. To permanently save data on disk

C. To encrypt data for security

D. To compress data to save space

Solution

1. Step 1: Understand buffer management role

   Buffer management temporarily holds data pages in memory to reduce slow disk access.

2. Step 2: Compare options

   Only To temporarily store data pages in memory for faster access describes temporary storage for faster access, others describe unrelated tasks.

3. Final Answer:

   To temporarily store data pages in memory for faster access -> Option A

4. Quick Check:

   Buffer management = temporary memory storage [OK]

Hint: Buffer means temporary memory storage for quick data access [OK]

Common Mistakes:

• Confusing buffer with permanent storage
• Thinking buffer encrypts data
• Assuming buffer compresses data

2. Which of the following is the correct operation to mark a page as in use in buffer management?

easy

A. unpin

B. replace

C. flush

D. pin

Solution

1. Step 1: Recall buffer operations

   Pin operation marks a page as in use so it is not replaced.

2. Step 2: Eliminate incorrect options

   Unpin releases the page, flush writes to disk, replace removes a page.

3. Final Answer:

   pin -> Option D

4. Quick Check:

   Pin = mark page in use [OK]

Hint: Pin means hold page in memory, unpin means release it [OK]

Common Mistakes:

• Confusing pin with unpin
• Thinking flush marks page in use
• Mixing replace with pin

3. Consider a buffer pool with 3 frames and pages requested in order: 2, 3, 2, 1, 5. Using the Least Recently Used (LRU) policy, which page will be replaced when page 5 is requested?

medium

A. Page 3

B. Page 1

C. Page 2

D. Page 5

Solution

1. Step 1: Track pages in buffer with LRU

   Initially empty: request 2 (load), 3 (load), 2 (already in buffer), 1 (load, buffer full now with 2,3,1).

2. Step 2: Identify least recently used page before requesting 5

   Pages in buffer: 2 (used recently), 3 (used before 1), 1 (most recent). LRU is page 3.

3. Step 3: Update usage after last request

   After the sequence 2,3,2,1, the usage order from most recent to least recent is 1,2,3. When page 5 is requested, the least recently used page is page 3, so page 3 should be replaced.

4. Final Answer:

   Page 3 -> Option A

5. Quick Check:

   LRU replaces least recently used page 3 [OK]

Hint: LRU removes the page not used for longest time [OK]

Common Mistakes:

• Replacing the most recently used page
• Confusing page numbers order
• Forgetting page 2 was used twice

4. A buffer manager uses the following code snippet to unpin a page:

if (page.pin_count > 0) {
  page.pin_count = page.pin_count - 1;
}

What is the likely error in this code?

medium

A. It increments pin_count instead of decrementing

B. It does not check if pin_count is already zero before decrementing

C. It should set pin_count to zero directly

D. It does not flush the page to disk

Solution

1. Step 1: Analyze the unpin logic

   The code decrements pin_count only if greater than zero, which is correct to avoid negative counts.

2. Step 2: Identify missing check

   However, if pin_count is zero, unpin should not be called or should raise error; code silently ignores this, which can hide bugs.

3. Final Answer:

   It does not check if pin_count is already zero before decrementing -> Option B

4. Quick Check:

   Unpin must avoid negative pin_count [OK]

Hint: Unpin must never reduce pin_count below zero [OK]

Common Mistakes:

• Ignoring pin_count zero condition
• Confusing increment and decrement
• Assuming flush is part of unpin

5. You have a buffer pool of size 2 and pages requested in this order: 4, 7, 4, 8, 7. Using the Clock replacement policy, which page will be replaced when page 7 is requested the second time?

hard

A. Page 8

B. Page 7

C. No page is replaced

D. Page 4

Solution

1. Step 1: Understand Clock policy basics

   Clock uses a circular pointer and reference bits to decide which page to replace.

2. Step 2: Track pages and reference bits

   Request 4 (load, ref=1), 7 (load, ref=1), 4 (ref bit set again), 8 (replace page with ref=0, but both 4 and 7 have ref=1, so pointer clears ref bits first, then replaces). When 7 is requested again, it is already in buffer with ref=1, so no replacement.

3. Final Answer:

   No page is replaced -> Option C

4. Quick Check:

   Clock keeps page if ref bit is set [OK]

Hint: Clock skips pages with reference bit set before replacing [OK]

Common Mistakes:

• Replacing a page that still has reference bit set
• Assuming immediate replacement on new request
• Confusing Clock with LRU policy