Proceedings of the VLDB Endowment, Vol. 19, No. 4, ISSN 2150-8097, 2026.
Qinghan Chen, Muhammad Haekal Muhyidin Al-Araby*, Ziyue Qiu, Zhuofan Chen, Rashmi Vinaya, Juncheng Yang^
Carnegie Mellon University
* Sepuluh Nopember Institute of Technology Surabaya, Indonesia
^ Harvard University
of modern data systems, yet their scalability is often limited by the high computational overhead associated with object promotions. Lazy Promotion techniques have emerged as relaxations of traditional Least-Recently-Used (LRU) methods, designed to alleviate lock contention and increase throughput. This work uses production traces from real-world systems to benchmark five Lazy Promotion strategies: Probabilistic-LRU, Batch-LRU, Delay-LRU, FIFO-reinsertion, and Random-LRU. We evaluate these techniques across miss ratio, scalability, promotion count, and a novel metric called promotion efficiency, which measures the number of hits per promotion. Our results reveal that Delay-LRU and FIFO-reinsertion significantly improve promotion efficiency, whereas Batch-LRU and Probabilistic-LRU struggle to reduce promotions without significantly increasing miss ratio. We further explore the impact of lazy promotion in advanced algorithms such as ARC and 2Q and make a similar observation. Moreover, we uncover substantial optimization potential, showing that most cache promotions are unnecessary when equipped with oracle knowledge. To further reduce promotions in LRU, we propose two novel enhancements—Delayed FIFO-reinsertion (D-FR) and Age-Guided Eviction (AGE)—that reduce promotions by 20—60% while achieving a similar or lower miss ratio.
FULL PAPER: pdf