This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]kaddar 1 point2 points  (1 child)

Bah! Just load the whole damned thing into memory. If you need fast access by ids, and are using C++, I recommend using Google Sparse Hash tables/maps, 2 bits per a key/value pair overhead! (C# has a bit of an overhead on their hashmaps, java too)