Buffer Pool — Buffer Management in… | OneNoughtOne

0/131

Database Management SystemsBuffer Management

Buffer Management in Database Systems

LevelIntermediate

Duration60 mins

TopicBuffer Management

1 / 5

Buffer Pool

The Memory-Storage Divide

Every database system faces a fundamental architectural challenge: data must be durable on persistent storage, but queries must execute at memory speeds . A modern CPU can access data in L1 cache in approximately 1 nanosecond. Accessing the same data from an SSD takes roughly 100,000 nanoseconds—a 100,000x performance gap. For spinning hard drives, the disparity reaches 10,000,000x. The buffer pool is the database system's answer to this challenge. It is a carefully managed region of main memory that caches frequently accessed disk pages, transforming what would be disk-bound workloads into memory-efficient operations. Understanding the buffer pool is essential for any engineer who wants to comprehend database performance, tune production systems, or design storage engines.

What You Will Learn

By the end of this page, you will understand what a buffer pool is, why it exists, how it is organized internally, and how database systems use it to bridge the performance gap between memory and storage. You'll gain insight into frame management, page pinning, and the fundamental data structures that underpin every modern DBMS.

The Fundamental Problem: Access Time Disparity

To appreciate the buffer pool's importance, we must first understand the stark reality of storage access times. The following table illustrates the approximate latencies across the memory hierarchy:

Memory Hierarchy Access Latencies
Storage Type	Access Latency	Relative to L1 Cache	Random IOPS
L1 Cache	~1 ns	1x	N/A (on-chip)
L2 Cache	~4 ns	4x	N/A (on-chip)
L3 Cache	~12 ns	12x	N/A (on-chip)
Main Memory (DRAM)	~100 ns	100x	N/A (random access)
NVMe SSD	~100 µs	100,000x	100K-1M IOPS
SATA SSD	~200 µs	200,000x	50K-100K IOPS
HDD (spinning disk)	~10 ms	10,000,000x	100-200 IOPS

The implications are profound: A query that touches 1,000 random pages on an HDD could require 10 seconds of disk I/O The same query against memory takes approximately 0.1 milliseconds Even with modern NVMe SSDs, the memory advantage is still 1,000x Database systems cannot simply read from disk on every query. The performance would be catastrophic. The buffer pool exists to ensure that the working set—the pages actively being used—resides in memory as much as possible.

The I/O Bottleneck Reality

In most database workloads, I/O is the bottleneck. A well-tuned buffer pool can mean the difference between a query taking 50 milliseconds versus 50 seconds. Buffer pool sizing and management is one of the most impactful tuning decisions for database performance.

What Is a Buffer Pool?

A buffer pool (sometimes called a buffer cache or page cache) is a region of main memory that the database management system uses to cache disk pages. When a query requires data, the DBMS first checks if the relevant page is already in the buffer pool. If so, the data is accessed directly from memory. If not, the page must be fetched from disk and placed into the buffer pool. Key terminology: Page: A fixed-size block of data (typically 4KB, 8KB, or 16KB) that is the unit of I/O and memory management Frame: A slot in the buffer pool that can hold exactly one page Buffer Pool: The collection of all frames available for caching pages Pin: A mechanism to prevent a page from being evicted while it is in use Page Hit: When a requested page is found in the buffer pool Page Miss: When a requested page must be fetched from disk

Core Buffer Pool Responsibilities

•Page Caching — Maintain an in-memory cache of frequently accessed pages to minimize disk I/O
•Memory Management — Allocate and deallocate frames efficiently as pages are fetched and evicted
•Concurrency Control — Ensure multiple transactions can safely access the same pages concurrently
•Dirty Page Tracking — Track which pages have been modified and must be written back to disk
•Eviction Policy — Decide which pages to remove when the buffer pool is full and a new page is needed
•Write-Ahead Logging Integration — Coordinate with the recovery subsystem to ensure durability

The Buffer Pool vs. OS Page Cache

Operating systems also maintain page caches. Why not rely on the OS? Because the DBMS has domain-specific knowledge the OS lacks: query patterns, transaction boundaries, and consistency requirements. Most production databases bypass or minimize OS caching (using O_DIRECT on Linux) to maintain full control over page management.

Buffer Pool Architecture

A buffer pool consists of several interconnected components that work together to provide efficient page caching. Understanding this architecture is essential for comprehending how databases achieve high performance.

Buffer Pool Components

•Frame Array — A contiguous array of memory slots, each capable of holding one page. The size of this array determines the buffer pool capacity.
•Page Table (Hash Table) — A mapping from (file_id, page_number) to frame_id, enabling O(1) lookup to determine if a page is cached and where it resides.
•Frame Descriptors — Metadata for each frame including: page_id, pin_count, dirty_bit, reference_bit, and latch state.
•Free List — A list of frames that are currently unoccupied and available for new pages.
•Replacement Data Structures — Auxiliary structures (e.g., LRU lists, clock hands) used by the eviction algorithm to select victim pages.

buffer_pool_structure.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
// Simplified buffer pool data structures
 
struct FrameDescriptor {
    PageId page_id;           // Which page is stored in this frame
    int    pin_count;         // Number of transactions using this page
    bool   is_dirty;          // Has the page been modified?
    bool   ref_bit;           // Recently referenced? (for clock algorithm)
    RWLatch latch;            // Concurrency control for the frame
};
 
struct BufferPool {
    // Core memory region: array of fixed-size frames
    Page* frames;                    // frames[frame_id] -> actual page data
    size_t pool_size;                // Number of frames in the pool
    
    // Page lookup table: (file_id, page_num) -> frame_id
    unordered_map<PageId, FrameId> page_table;
    
    // Metadata for each frame
    FrameDescriptor* descriptors;    // descriptors[frame_id] -> frame metadata
    
    // Free frame management
    list<FrameId> free_list;         // Frames not currently holding valid pages
    
    // Eviction algorithm state
    FrameId clock_hand;              // For clock replacement algorithm
    list<FrameId> lru_list;          // For LRU replacement algorithm
    
    // Synchronization
    mutex pool_latch;                // Protects page_table and free_list
};

Memory layout considerations: The frame array is typically allocated as a single large contiguous memory region during database startup. This approach offers several advantages: Simplified memory management: No fragmentation concerns within the buffer pool Efficient addressing: Frame access is a simple array index operation Predictable performance: No allocator overhead during query execution Memory locking: The entire region can be pinned to prevent swapping (using mlock on Linux) Modern databases like PostgreSQL, MySQL, and Oracle allow administrators to configure buffer pool size as a startup parameter (e.g., shared_buffers in PostgreSQL, innodb_buffer_pool_size in MySQL InnoDB).

The Page Table: Fast Page Lookup

The page table is a hash table that maps page identifiers to frame identifiers. When the buffer manager receives a request for a page, it must quickly determine: Is this page currently in the buffer pool? If so, which frame contains it? Without an efficient lookup mechanism, the buffer manager would need to scan the entire frame array—an O(n) operation that would be unacceptable for buffer pools with millions of frames.

page_table_operations.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Page identifier structure
struct PageId {
    uint32_t file_id;     // Database file identifier
    uint32_t page_num;    // Page number within the file
    
    // Hash function for use in hash table
    size_t hash() const {
        return std::hash<uint64_t>{}(
            (static_cast<uint64_t>(file_id) << 32) | page_num
        );
    }
    
    bool operator==(const PageId& other) const {
        return file_id == other.file_id && page_num == other.page_num;
    }
};
 
// Page table lookup
FrameId BufferPool::lookupPage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    auto it = page_table.find(page_id);
    if (it != page_table.end()) {
        return it->second;  // Page found in buffer pool
    }
    return INVALID_FRAME_ID;  // Page not cached
}
 
// Insert page into page table
void BufferPool::insertPage(PageId page_id, FrameId frame_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    page_table[page_id] = frame_id;
}
 
// Remove page from page table
void BufferPool::removePage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    page_table.erase(page_id);
}

Hash Table Implementation Choices

The page table is one of the most frequently accessed data structures in the DBMS. Modern implementations use concurrent hash tables (like Google's absl::flat_hash_map or Intel TBB's concurrent_hash_map) to minimize contention. Some systems partition the page table to reduce lock contention further.

Collision handling and performance: The page table uses standard hash table collision resolution (typically open addressing or chaining). Key performance factors include: Load factor: Keeping the hash table load factor below 0.7 ensures O(1) average-case lookups Hash function quality: A good hash function distributes page IDs uniformly across buckets Concurrency: High-contention workloads benefit from partitioned or lock-free hash tables For a buffer pool with 1 million frames, the page table might have 2 million buckets to maintain a low load factor, consuming approximately 16-32 MB of memory for the hash table overhead.

Frame Descriptors and Metadata

Each frame in the buffer pool is accompanied by a frame descriptor that stores essential metadata about the frame's current state. This metadata enables the buffer manager to make informed decisions about page management, eviction, and persistence.

Frame Descriptor Fields
Field	Type	Purpose
page_id	PageId	Identifies which page is currently stored in this frame
pin_count	integer	Number of threads/transactions currently using this page
is_dirty	boolean	True if the page has been modified since loading from disk
ref_bit	boolean	Set when page is accessed; used by clock replacement algorithm
latch	RWLatch	Reader-writer lock for concurrent access to the frame contents
lsn	LSN	Log Sequence Number of the last modification (for WAL)

The pin count mechanism: The pin_count is one of the most critical fields in the frame descriptor. When a transaction or query needs to access a page: The buffer manager increments the pin count before returning the page The page is guaranteed not to be evicted while the pin count is greater than zero When the transaction is done with the page, it decrements the pin count This mechanism prevents the buffer manager from evicting pages that are actively in use, which would cause data corruption or crashes.

pin_unpin_operations.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// Pin a page: increment pin count and return page pointer
Page* BufferPool::pinPage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    // Check if page is in buffer pool
    auto it = page_table.find(page_id);
    if (it != page_table.end()) {
        FrameId frame_id = it->second;
        descriptors[frame_id].pin_count++;
        descriptors[frame_id].ref_bit = true;  // Mark as recently used
        return &frames[frame_id];
    }
    
    // Page not in buffer pool - must fetch from disk
    FrameId victim_frame = findVictimFrame();
    if (victim_frame == INVALID_FRAME_ID) {
        throw BufferPoolFullException("No unpinned pages available");
    }
    
    // Evict victim page if necessary
    evictPage(victim_frame);
    
    // Load requested page from disk
    disk_manager->readPage(page_id, &frames[victim_frame]);
    
    // Update metadata
    descriptors[victim_frame].page_id = page_id;
    descriptors[victim_frame].pin_count = 1;
    descriptors[victim_frame].is_dirty = false;
    descriptors[victim_frame].ref_bit = true;
    
    page_table[page_id] = victim_frame;
    
    return &frames[victim_frame];
}
 
// Unpin a page: decrement pin count
void BufferPool::unpinPage(PageId page_id, bool is_dirty) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    auto it = page_table.find(page_id);
    if (it == page_table.end()) {
        throw PageNotFoundException("Page not in buffer pool");
    }
    
    FrameId frame_id = it->second;
    if (descriptors[frame_id].pin_count <= 0) {
        throw InvalidOperationException("Cannot unpin page with pin_count <= 0");
    }
    
    descriptors[frame_id].pin_count--;
    descriptors[frame_id].is_dirty |= is_dirty;  // OR with dirty flag
}

Pin Count Leaks

A pin count leak occurs when a page is pinned but never unpinned. Over time, pin count leaks cause the buffer pool to fill with pinned pages that cannot be evicted, eventually causing buffer pool exhaustion. Debugging pin count leaks is one of the more challenging aspects of buffer pool implementation.

Buffer Pool Sizing Considerations

Determining the appropriate buffer pool size is one of the most impactful configuration decisions for database performance. The goal is to cache as much of the working set as possible while leaving sufficient memory for other system needs. Factors influencing buffer pool size:

Sizing Considerations

•Working Set Size — The total size of pages that are frequently accessed. Ideally, the buffer pool should be large enough to hold the entire working set.
•Available Memory — Total system RAM minus memory needed for the OS, other applications, and DBMS components (query execution memory, lock tables, etc.).
•Read/Write Ratio — Write-heavy workloads may need more buffer pool space to batch dirty pages before flushing.
•Query Patterns — Workloads with good temporal and spatial locality benefit more from larger buffer pools.
•Data Distribution — Skewed access patterns (hot data) may require less buffer pool relative to database size.

Buffer Pool Sizing Guidelines
Database System	Configuration Parameter	Typical Recommendation
PostgreSQL	shared_buffers	25% of system RAM for dedicated servers
MySQL (InnoDB)	innodb_buffer_pool_size	70-80% of RAM for dedicated servers
Oracle	SGA size	40-80% of RAM depending on PGA needs
SQL Server	max server memory	Leave 4-8GB for OS, rest for SQL Server

The hit ratio metric: The buffer pool hit ratio measures the percentage of page requests satisfied from the buffer pool without disk I/O: Hit Ratio = (Page Hits / Total Page Requests) \times 100% A well-tuned system targeting OLTP workloads typically achieves hit ratios above 99%. Hit ratios below 90% often indicate insufficient buffer pool size or poor query patterns that don't exhibit locality.

Monitoring Buffer Pool Performance

Most database systems expose buffer pool statistics. In PostgreSQL, query pg_stat_bgwriter and pg_buffercache . In MySQL, check SHOW ENGINE INNODB STATUS or query information_schema.INNODB_BUFFER_POOL_STATS . Regularly monitoring these metrics helps identify when buffer pool resizing is needed.

Multiple Buffer Pools

In high-concurrency environments, a single buffer pool protected by a single mutex becomes a scalability bottleneck. Modern database systems address this through multiple buffer pools or buffer pool partitioning . Approaches to buffer pool partitioning:

Buffer Pool Partitioning Strategies

•Hash-based Partitioning — Pages are assigned to buffer pool instances based on a hash of the page ID. This distributes load evenly across instances.
•Purpose-based Partitioning — Separate buffer pools for different purposes (e.g., one for data pages, one for index pages).
•Tablespace-based Partitioning — Different tablespaces or files are served by different buffer pool instances.
•NUMA-aware Partitioning — Buffer pools are allocated to specific NUMA nodes to minimize cross-node memory access latency.

partitioned_buffer_pool.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// Partitioned buffer pool for improved concurrency
 
class PartitionedBufferPool {
private:
    static const size_t NUM_PARTITIONS = 128;  // Power of 2 for fast modulo
    BufferPool* partitions[NUM_PARTITIONS];
    
    // Determine which partition handles a given page
    size_t getPartitionIndex(PageId page_id) {
        // Hash-based partitioning
        size_t hash = std::hash<uint64_t>{}(
            (static_cast<uint64_t>(page_id.file_id) << 32) | page_id.page_num
        );
        return hash & (NUM_PARTITIONS - 1);  // Fast modulo for power of 2
    }
    
public:
    PartitionedBufferPool(size_t total_size) {
        size_t partition_size = total_size / NUM_PARTITIONS;
        for (size_t i = 0; i < NUM_PARTITIONS; i++) {
            partitions[i] = new BufferPool(partition_size);
        }
    }
    
    Page* pinPage(PageId page_id) {
        size_t idx = getPartitionIndex(page_id);
        return partitions[idx]->pinPage(page_id);
    }
    
    void unpinPage(PageId page_id, bool is_dirty) {
        size_t idx = getPartitionIndex(page_id);
        partitions[idx]->unpinPage(page_id, is_dirty);
    }
};

MySQL InnoDB's approach: MySQL InnoDB supports multiple buffer pool instances since version 5.6. The innodb_buffer_pool_instances parameter controls the number of instances. Each instance has its own LRU list, free list, and mutex. This dramatically reduces contention on high-core-count servers. For example, a server with 128GB buffer pool might use 8 or 16 instances, each managing 8-16GB of memory independently.

Partition Count Selection

The number of partitions should balance contention reduction against administrative overhead. Too few partitions invite contention; too many create overhead and may cause uneven page distribution. Common production configurations use 64-256 partitions, often sized to roughly match CPU core counts.

Database Management SystemsBuffer Management

Buffer Management in Database Systems

LevelIntermediate

Duration60 mins

TopicBuffer Management

1 / 5

Buffer Pool

The Memory-Storage Divide

Every database system faces a fundamental architectural challenge: data must be durable on persistent storage, but queries must execute at memory speeds . A modern CPU can access data in L1 cache in approximately 1 nanosecond. Accessing the same data from an SSD takes roughly 100,000 nanoseconds—a 100,000x performance gap. For spinning hard drives, the disparity reaches 10,000,000x. The buffer pool is the database system's answer to this challenge. It is a carefully managed region of main memory that caches frequently accessed disk pages, transforming what would be disk-bound workloads into memory-efficient operations. Understanding the buffer pool is essential for any engineer who wants to comprehend database performance, tune production systems, or design storage engines.

What You Will Learn

By the end of this page, you will understand what a buffer pool is, why it exists, how it is organized internally, and how database systems use it to bridge the performance gap between memory and storage. You'll gain insight into frame management, page pinning, and the fundamental data structures that underpin every modern DBMS.

The Fundamental Problem: Access Time Disparity

To appreciate the buffer pool's importance, we must first understand the stark reality of storage access times. The following table illustrates the approximate latencies across the memory hierarchy:

Memory Hierarchy Access Latencies
Storage Type	Access Latency	Relative to L1 Cache	Random IOPS
L1 Cache	~1 ns	1x	N/A (on-chip)
L2 Cache	~4 ns	4x	N/A (on-chip)
L3 Cache	~12 ns	12x	N/A (on-chip)
Main Memory (DRAM)	~100 ns	100x	N/A (random access)
NVMe SSD	~100 µs	100,000x	100K-1M IOPS
SATA SSD	~200 µs	200,000x	50K-100K IOPS
HDD (spinning disk)	~10 ms	10,000,000x	100-200 IOPS

The implications are profound: A query that touches 1,000 random pages on an HDD could require 10 seconds of disk I/O The same query against memory takes approximately 0.1 milliseconds Even with modern NVMe SSDs, the memory advantage is still 1,000x Database systems cannot simply read from disk on every query. The performance would be catastrophic. The buffer pool exists to ensure that the working set—the pages actively being used—resides in memory as much as possible.

The I/O Bottleneck Reality

In most database workloads, I/O is the bottleneck. A well-tuned buffer pool can mean the difference between a query taking 50 milliseconds versus 50 seconds. Buffer pool sizing and management is one of the most impactful tuning decisions for database performance.

What Is a Buffer Pool?

A buffer pool (sometimes called a buffer cache or page cache) is a region of main memory that the database management system uses to cache disk pages. When a query requires data, the DBMS first checks if the relevant page is already in the buffer pool. If so, the data is accessed directly from memory. If not, the page must be fetched from disk and placed into the buffer pool. Key terminology: Page: A fixed-size block of data (typically 4KB, 8KB, or 16KB) that is the unit of I/O and memory management Frame: A slot in the buffer pool that can hold exactly one page Buffer Pool: The collection of all frames available for caching pages Pin: A mechanism to prevent a page from being evicted while it is in use Page Hit: When a requested page is found in the buffer pool Page Miss: When a requested page must be fetched from disk

Core Buffer Pool Responsibilities

•Page Caching — Maintain an in-memory cache of frequently accessed pages to minimize disk I/O
•Memory Management — Allocate and deallocate frames efficiently as pages are fetched and evicted
•Concurrency Control — Ensure multiple transactions can safely access the same pages concurrently
•Dirty Page Tracking — Track which pages have been modified and must be written back to disk
•Eviction Policy — Decide which pages to remove when the buffer pool is full and a new page is needed
•Write-Ahead Logging Integration — Coordinate with the recovery subsystem to ensure durability

The Buffer Pool vs. OS Page Cache

Operating systems also maintain page caches. Why not rely on the OS? Because the DBMS has domain-specific knowledge the OS lacks: query patterns, transaction boundaries, and consistency requirements. Most production databases bypass or minimize OS caching (using O_DIRECT on Linux) to maintain full control over page management.

Buffer Pool Architecture

A buffer pool consists of several interconnected components that work together to provide efficient page caching. Understanding this architecture is essential for comprehending how databases achieve high performance.

Buffer Pool Components

•Frame Array — A contiguous array of memory slots, each capable of holding one page. The size of this array determines the buffer pool capacity.
•Page Table (Hash Table) — A mapping from (file_id, page_number) to frame_id, enabling O(1) lookup to determine if a page is cached and where it resides.
•Frame Descriptors — Metadata for each frame including: page_id, pin_count, dirty_bit, reference_bit, and latch state.
•Free List — A list of frames that are currently unoccupied and available for new pages.
•Replacement Data Structures — Auxiliary structures (e.g., LRU lists, clock hands) used by the eviction algorithm to select victim pages.

buffer_pool_structure.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
// Simplified buffer pool data structures
 
struct FrameDescriptor {
    PageId page_id;           // Which page is stored in this frame
    int    pin_count;         // Number of transactions using this page
    bool   is_dirty;          // Has the page been modified?
    bool   ref_bit;           // Recently referenced? (for clock algorithm)
    RWLatch latch;            // Concurrency control for the frame
};
 
struct BufferPool {
    // Core memory region: array of fixed-size frames
    Page* frames;                    // frames[frame_id] -> actual page data
    size_t pool_size;                // Number of frames in the pool
    
    // Page lookup table: (file_id, page_num) -> frame_id
    unordered_map<PageId, FrameId> page_table;
    
    // Metadata for each frame
    FrameDescriptor* descriptors;    // descriptors[frame_id] -> frame metadata
    
    // Free frame management
    list<FrameId> free_list;         // Frames not currently holding valid pages
    
    // Eviction algorithm state
    FrameId clock_hand;              // For clock replacement algorithm
    list<FrameId> lru_list;          // For LRU replacement algorithm
    
    // Synchronization
    mutex pool_latch;                // Protects page_table and free_list
};

Memory layout considerations: The frame array is typically allocated as a single large contiguous memory region during database startup. This approach offers several advantages: Simplified memory management: No fragmentation concerns within the buffer pool Efficient addressing: Frame access is a simple array index operation Predictable performance: No allocator overhead during query execution Memory locking: The entire region can be pinned to prevent swapping (using mlock on Linux) Modern databases like PostgreSQL, MySQL, and Oracle allow administrators to configure buffer pool size as a startup parameter (e.g., shared_buffers in PostgreSQL, innodb_buffer_pool_size in MySQL InnoDB).

The Page Table: Fast Page Lookup

The page table is a hash table that maps page identifiers to frame identifiers. When the buffer manager receives a request for a page, it must quickly determine: Is this page currently in the buffer pool? If so, which frame contains it? Without an efficient lookup mechanism, the buffer manager would need to scan the entire frame array—an O(n) operation that would be unacceptable for buffer pools with millions of frames.

page_table_operations.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Page identifier structure
struct PageId {
    uint32_t file_id;     // Database file identifier
    uint32_t page_num;    // Page number within the file
    
    // Hash function for use in hash table
    size_t hash() const {
        return std::hash<uint64_t>{}(
            (static_cast<uint64_t>(file_id) << 32) | page_num
        );
    }
    
    bool operator==(const PageId& other) const {
        return file_id == other.file_id && page_num == other.page_num;
    }
};
 
// Page table lookup
FrameId BufferPool::lookupPage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    auto it = page_table.find(page_id);
    if (it != page_table.end()) {
        return it->second;  // Page found in buffer pool
    }
    return INVALID_FRAME_ID;  // Page not cached
}
 
// Insert page into page table
void BufferPool::insertPage(PageId page_id, FrameId frame_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    page_table[page_id] = frame_id;
}
 
// Remove page from page table
void BufferPool::removePage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    page_table.erase(page_id);
}

Hash Table Implementation Choices

The page table is one of the most frequently accessed data structures in the DBMS. Modern implementations use concurrent hash tables (like Google's absl::flat_hash_map or Intel TBB's concurrent_hash_map) to minimize contention. Some systems partition the page table to reduce lock contention further.

Collision handling and performance: The page table uses standard hash table collision resolution (typically open addressing or chaining). Key performance factors include: Load factor: Keeping the hash table load factor below 0.7 ensures O(1) average-case lookups Hash function quality: A good hash function distributes page IDs uniformly across buckets Concurrency: High-contention workloads benefit from partitioned or lock-free hash tables For a buffer pool with 1 million frames, the page table might have 2 million buckets to maintain a low load factor, consuming approximately 16-32 MB of memory for the hash table overhead.

Frame Descriptors and Metadata

Each frame in the buffer pool is accompanied by a frame descriptor that stores essential metadata about the frame's current state. This metadata enables the buffer manager to make informed decisions about page management, eviction, and persistence.

Frame Descriptor Fields
Field	Type	Purpose
page_id	PageId	Identifies which page is currently stored in this frame
pin_count	integer	Number of threads/transactions currently using this page
is_dirty	boolean	True if the page has been modified since loading from disk
ref_bit	boolean	Set when page is accessed; used by clock replacement algorithm
latch	RWLatch	Reader-writer lock for concurrent access to the frame contents
lsn	LSN	Log Sequence Number of the last modification (for WAL)

The pin count mechanism: The pin_count is one of the most critical fields in the frame descriptor. When a transaction or query needs to access a page: The buffer manager increments the pin count before returning the page The page is guaranteed not to be evicted while the pin count is greater than zero When the transaction is done with the page, it decrements the pin count This mechanism prevents the buffer manager from evicting pages that are actively in use, which would cause data corruption or crashes.

pin_unpin_operations.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// Pin a page: increment pin count and return page pointer
Page* BufferPool::pinPage(PageId page_id) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    // Check if page is in buffer pool
    auto it = page_table.find(page_id);
    if (it != page_table.end()) {
        FrameId frame_id = it->second;
        descriptors[frame_id].pin_count++;
        descriptors[frame_id].ref_bit = true;  // Mark as recently used
        return &frames[frame_id];
    }
    
    // Page not in buffer pool - must fetch from disk
    FrameId victim_frame = findVictimFrame();
    if (victim_frame == INVALID_FRAME_ID) {
        throw BufferPoolFullException("No unpinned pages available");
    }
    
    // Evict victim page if necessary
    evictPage(victim_frame);
    
    // Load requested page from disk
    disk_manager->readPage(page_id, &frames[victim_frame]);
    
    // Update metadata
    descriptors[victim_frame].page_id = page_id;
    descriptors[victim_frame].pin_count = 1;
    descriptors[victim_frame].is_dirty = false;
    descriptors[victim_frame].ref_bit = true;
    
    page_table[page_id] = victim_frame;
    
    return &frames[victim_frame];
}
 
// Unpin a page: decrement pin count
void BufferPool::unpinPage(PageId page_id, bool is_dirty) {
    std::lock_guard<std::mutex> guard(pool_latch);
    
    auto it = page_table.find(page_id);
    if (it == page_table.end()) {
        throw PageNotFoundException("Page not in buffer pool");
    }
    
    FrameId frame_id = it->second;
    if (descriptors[frame_id].pin_count <= 0) {
        throw InvalidOperationException("Cannot unpin page with pin_count <= 0");
    }
    
    descriptors[frame_id].pin_count--;
    descriptors[frame_id].is_dirty |= is_dirty;  // OR with dirty flag
}

Pin Count Leaks

A pin count leak occurs when a page is pinned but never unpinned. Over time, pin count leaks cause the buffer pool to fill with pinned pages that cannot be evicted, eventually causing buffer pool exhaustion. Debugging pin count leaks is one of the more challenging aspects of buffer pool implementation.

Buffer Pool Sizing Considerations

Determining the appropriate buffer pool size is one of the most impactful configuration decisions for database performance. The goal is to cache as much of the working set as possible while leaving sufficient memory for other system needs. Factors influencing buffer pool size:

Sizing Considerations

•Working Set Size — The total size of pages that are frequently accessed. Ideally, the buffer pool should be large enough to hold the entire working set.
•Available Memory — Total system RAM minus memory needed for the OS, other applications, and DBMS components (query execution memory, lock tables, etc.).
•Read/Write Ratio — Write-heavy workloads may need more buffer pool space to batch dirty pages before flushing.
•Query Patterns — Workloads with good temporal and spatial locality benefit more from larger buffer pools.
•Data Distribution — Skewed access patterns (hot data) may require less buffer pool relative to database size.

Buffer Pool Sizing Guidelines
Database System	Configuration Parameter	Typical Recommendation
PostgreSQL	shared_buffers	25% of system RAM for dedicated servers
MySQL (InnoDB)	innodb_buffer_pool_size	70-80% of RAM for dedicated servers
Oracle	SGA size	40-80% of RAM depending on PGA needs
SQL Server	max server memory	Leave 4-8GB for OS, rest for SQL Server

The hit ratio metric: The buffer pool hit ratio measures the percentage of page requests satisfied from the buffer pool without disk I/O: Hit Ratio = (Page Hits / Total Page Requests) \times 100% A well-tuned system targeting OLTP workloads typically achieves hit ratios above 99%. Hit ratios below 90% often indicate insufficient buffer pool size or poor query patterns that don't exhibit locality.

Monitoring Buffer Pool Performance

Most database systems expose buffer pool statistics. In PostgreSQL, query pg_stat_bgwriter and pg_buffercache . In MySQL, check SHOW ENGINE INNODB STATUS or query information_schema.INNODB_BUFFER_POOL_STATS . Regularly monitoring these metrics helps identify when buffer pool resizing is needed.

Multiple Buffer Pools

In high-concurrency environments, a single buffer pool protected by a single mutex becomes a scalability bottleneck. Modern database systems address this through multiple buffer pools or buffer pool partitioning . Approaches to buffer pool partitioning:

Buffer Pool Partitioning Strategies

•Hash-based Partitioning — Pages are assigned to buffer pool instances based on a hash of the page ID. This distributes load evenly across instances.
•Purpose-based Partitioning — Separate buffer pools for different purposes (e.g., one for data pages, one for index pages).
•Tablespace-based Partitioning — Different tablespaces or files are served by different buffer pool instances.
•NUMA-aware Partitioning — Buffer pools are allocated to specific NUMA nodes to minimize cross-node memory access latency.

partitioned_buffer_pool.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// Partitioned buffer pool for improved concurrency
 
class PartitionedBufferPool {
private:
    static const size_t NUM_PARTITIONS = 128;  // Power of 2 for fast modulo
    BufferPool* partitions[NUM_PARTITIONS];
    
    // Determine which partition handles a given page
    size_t getPartitionIndex(PageId page_id) {
        // Hash-based partitioning
        size_t hash = std::hash<uint64_t>{}(
            (static_cast<uint64_t>(page_id.file_id) << 32) | page_id.page_num
        );
        return hash & (NUM_PARTITIONS - 1);  // Fast modulo for power of 2
    }
    
public:
    PartitionedBufferPool(size_t total_size) {
        size_t partition_size = total_size / NUM_PARTITIONS;
        for (size_t i = 0; i < NUM_PARTITIONS; i++) {
            partitions[i] = new BufferPool(partition_size);
        }
    }
    
    Page* pinPage(PageId page_id) {
        size_t idx = getPartitionIndex(page_id);
        return partitions[idx]->pinPage(page_id);
    }
    
    void unpinPage(PageId page_id, bool is_dirty) {
        size_t idx = getPartitionIndex(page_id);
        partitions[idx]->unpinPage(page_id, is_dirty);
    }
};

MySQL InnoDB's approach: MySQL InnoDB supports multiple buffer pool instances since version 5.6. The innodb_buffer_pool_instances parameter controls the number of instances. Each instance has its own LRU list, free list, and mutex. This dramatically reduces contention on high-core-count servers. For example, a server with 128GB buffer pool might use 8 or 16 instances, each managing 8-16GB of memory independently.

Partition Count Selection

The number of partitions should balance contention reduction against administrative overhead. Too few partitions invite contention; too many create overhead and may cause uneven page distribution. Common production configurations use 64-256 partitions, often sized to roughly match CPU core counts.

Buffer Pool

The Memory-Storage Divide

The Fundamental Problem: Access Time Disparity

What Is a Buffer Pool?

Buffer Pool Architecture

The Page Table: Fast Page Lookup

Frame Descriptors and Metadata

Buffer Pool Sizing Considerations

Multiple Buffer Pools

Buffer Pool Partitioning Strategies

There’s more to understand.

Buffer Pool

The Memory-Storage Divide

The Fundamental Problem: Access Time Disparity

What Is a Buffer Pool?

Buffer Pool Architecture

The Page Table: Fast Page Lookup

Frame Descriptors and Metadata

Buffer Pool Sizing Considerations

Multiple Buffer Pools

Buffer Pool Partitioning Strategies

There’s more to understand.