Programmers / software engineers -- does this exist: I'm looking for a very efficient high-speed ID lookup system where I pass an integer to it (8 bytes, but configurable would be awesome) and it will index that id into file segments (configurable size) and periodically sort ...
Conversation
Replying to
For testing membership, a 64-bit Judy1 array would also work.
1
2
Replying to
They're really cool, I wrote something way back in the day in C to convert between a Judy1 array and a simple Bloom filter implementation, but never had a real use for it.
1
1
Replying to
So if I'm reading correctly, these arrays are still efficient with storing ids similiar to Twitter ids where there may be wide spaces between ids (no sequential ids in the space)?
1
1
Show replies