k - SNAP - Stanford University


k - SNAP - Stanford University

Approach 1:

Store triples [i, j, c], where count(i , j) = c

If integers and item ids are 4 bytes, we need

approximately 12 bytes for pairs with count > 0

Plus some additional overhead for the hashtable

What if most pairs occur, even if infrequently?

1/5/2011 Jure Leskovec, Stanford C246: Mining Massive Datasets 24

More magazines by this user
Similar magazines