Does anyone have a better understanding of why the leopard indexing system uses skip lists to store the index sets for fast set intersections? I get that it does a group2group set lookup and a user2group set lookup, and the intersection of those sets determine whether there is a path, but don’t fully understand why they use a skil list as opposed using a hashtable with hashsets as the values for fast intersections