EUVIMEDEUVIMED entdecken
Crossref

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

Xinbiao Gan, Tiejun Li, Chunye Gong, Dongsheng Li, Dezun Dong, Jie Liu, Kai Lu

Proceedings of the VLDB Endowment · 2025-07 · 18 (11) · 4255-4268

DOI: 10.14778/3749646.3749691 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the VLDB Endowment, online erschienen am 04.09.2025. Verfasst von Xinbiao Gan und 6 weiteren Autor:innen. Die Arbeit wurde bisher 42-mal zitiert (Crossref) und nennt 53 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph processing underpins a vast array of data-centric applications, serving as a crucial component in fields such as social network analysis, recommendation systems, bio-informatics, and search engines. As graph data grows in scale and complexity, high-performance graph processing is increasingly essential. Many graph processing tasks depend on efficient data structures to manage the sparsity typical of real-world graphs, where most vertices have limited connectivity. This sparsity poses challenges for memory and computational efficiency in large-scale graph processing, and conventional sparse formats like Compressed Sparse Row (CSR) often struggle with memory and computation inefficiencies when handling massive graphs. To address these challenges, we introduce GraphCSR, a degree-equalized CSR format specifically tailored to enhance the spatio-temporal efficiency of distributed graph processing across various tasks. GraphCSR aggregates low-degree vertices into synthetic high-degree ones and applies group-wise compression to reduce storage overhead by recording only the starting index for each aggregated group. This reduces memory usage and supports batch-memory access to improve performance. Our extensive evaluations in various graph processing algorithms and datasets demonstrate that GraphCSR not only reduces the memory footprint required for large-scale graphs, but also improves performance across multiple types of graph processing tasks, outperforming popular sparse storage formats. Furthermore, when deployed on a production-scale supercomputer with 79,024 nodes, GraphCSR achieved a graph processing throughput that exceeded the top-ranked system on the Graph500 benchmark.

Zitieren

APA

Gan, X., Li, T., Gong, C., Li, D., Dong, D., Liu, J., & Lu, K. (2025). GraphCSR: A Degree-Equalized CSR Format for Large-Scale Graph Processing. Proceedings of the VLDB Endowment, 18(11), 4255-4268. https://doi.org/10.14778/3749646.3749691

Vancouver

Gan X, Li T, Gong C, Li D, Dong D, Liu J, et al. GraphCSR: A Degree-Equalized CSR Format for Large-Scale Graph Processing. Proceedings of the VLDB Endowment. 2025;18(11):4255-4268. doi:10.14778/3749646.3749691

BibTeX
@article{Gan2025,
  author = {Gan, Xinbiao and Li, Tiejun and Gong, Chunye and Li, Dongsheng and Dong, Dezun and Liu, Jie and Lu, Kai},
  title = {GraphCSR: A Degree-Equalized CSR Format for Large-Scale Graph Processing},
  journal = {Proceedings of the VLDB Endowment},
  year = {2025},
  volume = {18},
  number = {11},
  pages = {4255--4268},
  doi = {10.14778/3749646.3749691}
}
Kostenlos starten →