Algorithms on billion-scale graph using 10GB RAM: I love DataFusion

·Hacker News··

In a previous post, I was sceptical about using Apache DataFusion for graph analytics. However, after some thought and experimentation, I changed my mind. I have reconsidered my approach and now have a working implementation of basic graph algorithms, such as WCC, PageRank and MSSP. For example, I can identify weakly connected components in a graph with two billion edges using just 10 GB of RAM and two cores. This is one of the most widely used graph algorithms and lies behind most entity resolu

Read full article →

Related Articles

Google Search is now less than half of Alphabet’s revenue
hubraumhugo · Hacker News · 11h ago
We're releasing the weights of Mistral Large 4
kuberwastaken · Hacker News · 14h ago
H.264 Is Magic (2016)
ea016 · Hacker News · 12h ago
The US added a record 20.2 GWh of battery storage in just 3 months
ljf · Hacker News · 17h ago
We ran AI agent swarms in Minecraft and Mindustry
sandslash · Hacker News · 6h ago