Effective buffer management replacement algorithm for parallel shared-nothing database systems
Numerical methods and programming, Tome 3 (2002) no. 2, pp. 11-28
Voir la notice de l'article provenant de la source Math-Net.Ru
We introduce a new approach to database disk buffering, called the LFU-K
method. The LFU-K page replacement algorithm is an improvement of the Least
Frequently Used (LFU) algorithm. A probability-theoretical model for a formal
description of the LFU-K algorithm is proposed. Using this model, we obtain
some estimates for the LFU-K parameters. An implementation of LFU-2 policy
(called LFU-2m algorithm) is discussed. As we demonstrate with trace-driven
simulation experiments, the LFU-2m algorithm performs better than the
conventional buffering algorithm for the shared-nothing database system workloads.
Keywords:
parallel database systems, buffer management, page replacement algorithms, efficiency analysis.
@article{VMP_2002_3_2_a1,
author = {L. B. Sokolinskii},
title = {Effective buffer management replacement algorithm for parallel shared-nothing database systems},
journal = {Numerical methods and programming},
pages = {11--28},
publisher = {mathdoc},
volume = {3},
number = {2},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2002_3_2_a1/}
}
TY - JOUR AU - L. B. Sokolinskii TI - Effective buffer management replacement algorithm for parallel shared-nothing database systems JO - Numerical methods and programming PY - 2002 SP - 11 EP - 28 VL - 3 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMP_2002_3_2_a1/ LA - ru ID - VMP_2002_3_2_a1 ER -
L. B. Sokolinskii. Effective buffer management replacement algorithm for parallel shared-nothing database systems. Numerical methods and programming, Tome 3 (2002) no. 2, pp. 11-28. http://geodesic.mathdoc.fr/item/VMP_2002_3_2_a1/