Google Summer of Code 2019/Graph compression: Difference between revisions

Revision as of 08:23, 21 August 2019

Title: Graph compression
Description: The Software Heritage data model is a big Merkle DAG made of nodes like revisions, releases, directories, etc. It is a very big graph, with ~10 B nodes and ~160 B edges, which makes it hard to fit in memory using naive approaches. Graph compression techniques have been successfully used to compress the Web graph (which is slightly larger than the Software Heritage one) and make it fit in memory. The goal of this GSoC project is review existing graph compression techniques and apply the most appropriate one to the Software Heritage case, enabling in-memory processing of its Merkle DAG.
Student: Thibault Allançon
- forge activity
- project on the GSoC portal
Code:
- swh-graph git
Mentors:
- Stefano Zacchiroli
- Antoine Pietri
Activity reports:
- March 2019
- April 2019
- May 2019
- June 2019
- July 2019
- August 2019

@@ Line 3: / Line 3: @@
 * '''Student:''' Thibault Allançon
 ** [https://forge.softwareheritage.org/p/haltode/ forge activity]
+** [https://summerofcode.withgoogle.com/projects/#4670175868092416 project on the GSoC portal]
 * '''Code:'''
 ** [https://forge.softwareheritage.org/source/swh-graph/ swh-graph git]
@@ Line 29: / Line 30: @@
 *** [https://sympa.inria.fr/sympa/arc/swh-devel/2019-08/msg00003.html week 2019/32]
 *** [https://sympa.inria.fr/sympa/arc/swh-devel/2019-08/msg00006.html week 2019/33]
-== Links ==
-* [https://forge.softwareheritage.org/source/graph-compression/ source code repository]
-* see project [https://summerofcode.withgoogle.com/projects/#4670175868092416 on the GSoC portal]
 [[Category:Google Summer of Code]]
 [[Category:Google Summer of Code 2019]]