Neo Kim @systemdesign.one · Jan 23 • They find it using a Set intersection operation. • Set 1 tracks the people I follow; Set 2 tracks the people who follow Jay. • The intersection of the sets gives the expected result.
1 likes 1 replies
?
Replies
• An in-memory graph service prevents expensive database queries and performs intersections quickly. • But Redis Sets don't use different CPU cores at once. • So they implement it using Roaring Bitmaps.