Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-based algorithms to more accurate but potentially costly methods tailored to specific data access patterns. The principal issue in adopting a pattern-specific replacement logic in a DB buffer manager is to guarantee non-degradation in general high-load regimes. In this paper, we propose a new family of page replacement algorithms for DB buffer manager which demonstrate a superior performance wrt competitors on custom data access patterns and imply a low computational overhead on TPC-C. We provide theoretical foundations and an extensive experimental study on the proposed algorithms which covers synthetic benchmarks and an implementation in an open-source DB kernel evaluated on TPC-C.

翻译：最优页替换是高效缓冲管理中的一个重要问题。文献中已知的替换策略范围涵盖从简单高效的基于FIFO的算法到针对特定数据访问模式设计但可能代价高昂的精确方法。在数据库缓冲管理器中采用模式特定的替换逻辑时，主要问题在于确保在高负载通用场景下性能不退化。本文提出了一族适用于数据库缓冲管理器的页替换算法，这些算法在定制数据访问模式上相较竞品展现出更优性能，并在TPC-C测试中保持低计算开销。我们提供了理论基础，并基于合成基准测试与在开源数据库内核中实现的TPC-C验证实验，对所提算法进行了全面的实验研究。