Database Paper Browser

Back to papers

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)

Paper ID
13926
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,642 | 25.97%
DOI
10.14778/3746405.3746413

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers