DBScholar

Back to papers

GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing

Summary: GraphCSR: degree-equalized CSR aggregating low-degree vertices into synthetic high-degree groups, storing only group start indices for group-wise compression and batched memory access. Cuts memory and improves throughput across graph algorithms, scaling to 79,024 nodes and surpassing the top Graph500 system. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h1883dce6494f014d
Venue
VLDB
Year
2025
Pagerank
4.9793485e-05
Overall Rank
11,358 | 23.64%
DOI
10.14778/3749646.3749691

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{gan_vldb25,
        title = {{GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing}},
        author = {Gan, Xinbiao and Li, Tiejun and Gong, Chunye and Li, Dongsheng and Dong, Dezun and Liu, Jie and Lu, Kai},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {11},
        pages = {4255--4268},
        doi = {10.14778/3749646.3749691},
        url = {https://doi.org/10.14778/3749646.3749691},
        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 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
419 Cypher: An Evolving Query Language for Property Graphs 2018 SIGMOD 0.0001854669
783 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00014021799
1,804 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.6025094e-05
2,774 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.0327008e-05
Previous Page 1 / 1 Next

Semantically Similar Papers