Difference between revisions of "Google Summer of Code 2019/Graph compression"
Jump to navigation
Jump to search
(Add weekly report 2019/27) |
(Add weekly report 2019/28) |
||
| Line 21: | Line 21: | ||
** July 2019 | ** July 2019 | ||
*** [https://sympa.inria.fr/sympa/arc/swh-devel/2019-07/msg00001.html week 2019/27] | *** [https://sympa.inria.fr/sympa/arc/swh-devel/2019-07/msg00001.html week 2019/27] | ||
| + | *** [https://sympa.inria.fr/sympa/arc/swh-devel/2019-07/msg00005.html week 2019/28] | ||
== Links == | == Links == | ||
Revision as of 20:33, 12 July 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
- Mentors:
- Stefano Zacchiroli
- Antoine Pietri
- Activity reports:
- March 2019
- April 2019
- May 2019
- June 2019
- July 2019
Links
- source code repository
- see project on the GSoC portal