DBScholar

Back to papers

CAVE: Concurrency-Aware Graph Processing on SSDs

Summary: CAVE is a first SSD-native out-of-core graph engine, explicitly scheduling graph I/Os to exploit device parallelism rather than HDD-style sequential access. Key idea: intra/inter-subgraph concurrency + blocked adjacency layout + concurrent cache pool; up to 10x over Mosaic/GridGraph. (summarized by gpt-5.4-mini on May 24 2026)

Paper ID
6952
Venue
SIGMOD
Year
2024
Pagerank
5.8643667e-05
Overall Rank
6,490 | 55.48%
DOI
10.1145/3654928

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{papon_sigmod24,
        title = {{CAVE: Concurrency-Aware Graph Processing on SSDs}},
        author = {Papon, Tarikul Islam and Chen, Taishan and Zhang, Shuo and Athanassoulis, Manos},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654928},
        url = {https://dl.acm.org/doi/10.1145/3654928},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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