Skip to content
Snippets Groups Projects
vlorentz's avatar
vlorentz authored
It seems to be slightly faster on ZSTD-compressed filesystems, as it does not need to read `graph.pthash.order` and `graph.node2swhid.bin` all the time to parse the input.
c9c65170
History

Software Heritage - graph service

Tooling and services, collectively known as swh-graph, providing fast access to the graph representation of the Software Heritage archive. The service is in-memory, based on a compressed representation of the Software Heritage Merkle DAG.

Bibliography

In addition to accompanying technical documentation, swh-graph is also described in the following scientific paper. If you publish results based on swh-graph, please acknowledge it by citing the paper as follows:

Note

Paolo Boldi, Antoine Pietri, Sebastiano Vigna, Stefano Zacchiroli. Ultra-Large-Scale Repository Analysis via Graph Compression. In proceedings of SANER 2020: The 27th IEEE International Conference on Software Analysis, Evolution and Reengineering, pages 184-194. IEEE 2020.

Links: preprint, bibtex.