Year: 2024
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Demin, Alexander, Dorn, Yuriy, Katrutsa, Aleksandr, Kazantsev, Daniil, Latypov, Ilgam, Maximlyuk, Yulia, Ponomaryov, Denis
Institutions: A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Moscow Institute of Physics and Technology, Lomonosov Moscow State University, Skolkovo Institute of Science and Technology, AIRI - Artificial Intelligence Research Institute, Sobolev Institute of Mathematics
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4396601104