A Configurable Framework for High-Performance Graph Storage and Mutation.

Autor: Firmli, Soukaina, Chiadmi, Dalila, Dahbi, Kawtar Younsi

Publikováno v: International Journal of Advanced Computer Science & Applications; Aug2024, Vol. 15 Issue 8, p1323-1331, 9p

CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure

Autor: Firmli, Soukaina, Trigonakis, Vasileios, Lozi, Jean-Pierre, Psaroudakis, Iraklis, Weld, Alexander, Chiadmi, Dalila, Hong, Sungpack, Chafi, Hassan

Publikováno v: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS '20)
24th International Conference on Principles of Distributed Systems (OPODIS '20)
24th International Conference on Principles of Distributed Systems (OPODIS '20), Dec 2020, Strasbourg (on line), France. ⟨10.4230/LIPIcs.OPODIS.2020.17⟩

The graph model enables a broad range of analysis, thus graph processing is an invaluable tool in data analytics. At the heart of every graph-processing system lies a concurrent graph data structure storing the graph. Such a data structure needs to b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::263fe843308c936962ab210da84cf266
https://hal.archives-ouvertes.fr/hal-03060095/file/paper.pdf