Locality-Aware Cache Replacement Policy for Graph Traversals
Summary: LAC: a graph-locality-aware cache replacement policy that leverages graph-ordering serialization layout to turn spatial locality on disk pages into predicted temporal reuse for cache eviction. Beats GCLOCK across graphs/queries, reducing page faults and latency up to 1.42× (sim) / 1.23× (Neo4j). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zeynep Korkmaz (University of Waterloo)
- 2. M. Tamer Özsu (University of Waterloo)
- 3. Khuzaima Daudjee (University of Waterloo)
BibTeX Citation
@article{korkmaz_vldb25,
title = {{Locality-Aware Cache Replacement Policy for Graph Traversals}},
author = {Korkmaz, Zeynep and Özsu, M. Tamer and Daudjee, Khuzaima},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {9},
pages = {2859--2871},
doi = {10.14778/3746405.3746413},
url = {https://doi.org/10.14778/3746405.3746413},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 212 | The LRU-K Page Replacement Algorithm For Database Disk Buffering | 1993 | SIGMOD | 0.00024767296 |
| 239 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.000235107 |
| 387 | The LDBC Social Network Benchmark: Interactive Workload | 2015 | SIGMOD | 0.00019426275 |
| 1,440 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD | 0.00010641888 |
| 1,752 | Kuzu* Graph Database Management System | 2023 | CIDR | 9.7289339e-05 |
| 1,963 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 9.3063317e-05 |
| 5,172 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB | 6.2439642e-05 |
| 6,617 | CAVE: Concurrency-Aware Graph Processing on SSDs | 2024 | SIGMOD | 5.7327861e-05 |
| 9,094 | Caching at the Web Scale | 2017 | VLDB | 5.2283159e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,555 | A Performance Study Of Transitive Closure Algorithms | 1994 | SIGMOD |
| 2 | 1,963 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 3 | 3,920 | Effective Caching of Shortest Paths for Location-Based Services | 2012 | SIGMOD |
| 4 | 9,805 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 5 | 1,280 | LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans | 2020 | VLDB |
| 6 | 3,154 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |
| 7 | 5,844 | Graph-Aware, Workload-Adaptive SPARQL Query Caching | 2015 | SIGMOD |
| 8 | 416 | Semantic Data Caching and Replacement | 1996 | VLDB |
| 9 | 5,734 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD |
| 10 | 1,440 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD |