Posts Tagged ‘1-hop neighbours problem’

The 1-hop neighbours problem

The problem of computing number of friends connecting two individuals forms the heart of people recommendation engines. This problem is easy to express in small data contexts (e.g. using SQL) but are notoriously hard to solve with good performance on massive, real-world networks. We discuss why.