How to Compute Mutual Friends for 100M Users in Seconds with Redis

This article breaks down the massive‑scale challenge of calculating mutual friends for hundreds of millions of users, analyzes data‑size, latency, and memory constraints, and presents three Redis‑based solutions—basic Set, bitmap, and a sharded architecture—complete with code snippets, performance numbers, and practical trade‑offs.

BitmapMutual FriendsScalable Computing

0 likes · 10 min read

How to Compute Mutual Friends for 100M Users in Seconds with Redis

DataFunTalk

Apr 18, 2022 · Databases

Subgraph Matching in Graph Databases: Concepts, Algorithms, and Optimizations

This article introduces graph databases, explains the subgraph‑matching problem, compares it with relational databases, discusses its computational complexity, and surveys backtracking and multi‑way join algorithms, worst‑case optimal joins, set‑intersection SIMD acceleration, and the gStore system’s research contributions.

RDFSIMDSPARQL

0 likes · 19 min read

Subgraph Matching in Graph Databases: Concepts, Algorithms, and Optimizations