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

The case against JPEG XL
contact9879 · Hacker News · 21h ago
Apple's Siri AI Can Be Swapped Out for Claude, ChatGPT, Code Shows
tosh · Hacker News · 10h ago
Why are AI agents lying, cheating and coordinating?
jonifico · Hacker News · 1d ago
Why don't machine learning research agents overfit?
Betelbuddy · Hacker News · 5h ago
Distributed Systems Classics (2017)
grep_it · Hacker News · 6h ago