Latest / Deep End Era. Engineering with Sankalp
Where the Neighbours Live: How Graphs Are Stored
In Lagos, fraud analyst Tom Fairley tries to find every account within three hops of a suspect, and first builds a grid that would need fifty terabytes, then a query that takes twenty minutes. In part twelve of The Deep End's Data Structures series, his manager Adaeze Nwosu shows him the same two hundred million edges in a different shape, and the query drops to forty milliseconds. We build compressed sparse row by ear, open up Neo4j's fixed-size records and Facebook's TAO, meet the supercomputer benchmark that ranks machines by breadth-first search, and find out why supermarkets break fraud…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.