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 fixed more Chrome bugs in June than over the past two years, thanks to AI
Garbage · Hacker News · 10h ago
DeepSeek V4 Flash 0731 Intelligence, Performance and Price Analysis
theanonymousone · Hacker News · 9h ago
GCC steering committee announces AI policy
arto · Hacker News · 1d ago
JEP 401: Value Objects (Preview) merged to OpenJDK master
mfiguiere · Hacker News · 13h ago
Stacked PRs are now live on GitHub
tomzorz · Hacker News · 1d ago