[OT] Best algorithm for extremely large hashtable?

[Andrei Alexandrescu]

On 11/15/13 11:20 AM, H. S. Teoh wrote:
> I'm hoping for a kind of compressed representation where multiple
> adjacent nodes can be represented in a very compact way, by somehow
> taking advantage of the fact that they lie on an n-dimensional grid and
> the fact that graph edges are always a subset of grid edges (as opposed
> to edges between two arbitrary nodes).

The classic trick here is parallel arrays - you store a bit array in 
parallel with an array of nodes.

Andrei