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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xinbiao Gan
- 2. Tiejun Li
- 3. Chunye Gong
- 4. Dongsheng Li
- 5. Dezun Dong
- 6. Jie Liu
- 7. Kai Lu
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 |
|---|---|---|---|---|
| 787 | Cypher: An Evolving Query Language for Property Graphs | 2018 | SIGMOD | 0.00016624372 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 2,199 | gStore: Answering SPARQL Queries via Subgraph Matching | 2011 | VLDB | 9.3082437e-05 |
| 3,287 | GraphScope: A Unified Engine For Big Graph Processing | 2021 | VLDB | 7.2689944e-05 |
Previous
Page 1 / 1
Next