EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916230139478016 |
|---|---|
| author | Demin, Alexander Dorn, Yuriy Katrutsa, Aleksandr Kazantsev, Daniil Latypov, Ilgam Maximlyuk, Yulia Ponomaryov, Denis |
| author_facet | Demin, Alexander Dorn, Yuriy Katrutsa, Aleksandr Kazantsev, Daniil Latypov, Ilgam Maximlyuk, Yulia Ponomaryov, Denis |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_00154 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement Demin, Alexander Dorn, Yuriy Katrutsa, Aleksandr Kazantsev, Daniil Latypov, Ilgam Maximlyuk, Yulia Ponomaryov, Denis Databases 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. |
| title | EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement |
| topic | Databases |
| url | https://arxiv.org/abs/2405.00154 |