WebGraph: The Next Generation (Is in Rust)
Open Access
- 13 May 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 686-689
Abstract
We report the results of a yearlong effort at the Laboratory for Web Algorithmics and Inria to port the WebGraph framework [4] from Java to Rust. For two decades WebGraph has been instrumental in the analysis and distribution of large graphs for the research community of TheWebConf, but the intrinsic limitations of the Java Virtual Machine had become a bottleneck for very large use cases, such as the Software Heritage Merkle graph [2] with its half a trillion arcs. As part of this clean-slate implementation of WebGraph in Rust, we developed a few ancillary projects bringing to the Rust ecosystem some missing features of independent interest, such as easy, consistent and zero-cost memory mapping of data structures. WebGraph in Rust offers impressive performance improvements over the previous implementation, enabling open-source graph analytics on very large datasets like Common Crawl, on top of a modern systems programming language.Keywords
Funding Information
- Ministero dell'Università e della Ricerca (SERICS (PE00000014))
- Agencie National de la Recherche (COREGRAPHIE (ANR-20-CE23-0002))
This publication has 9 references indexed in Scilit:
- On Overcoming HPC Challenges of Trillion-Scale Real-World Graph Datasets2023
- Ultra-Large-Scale Repository Analysis via Graph Compression2020
- The Software Heritage Graph Dataset: Public Software Development Under One Roof2019
- The use of asymmetric numeral systems as an accurate replacement for Huffman coding2015
- The rust language2014
- Four degrees of separation2012
- A large time-aware web graphACM SIGIR Forum, 2008
- The webgraph framework I2004
- Efficient Storage and Retrieval by Content and Address of Static FilesJournal of the ACM, 1974