3 ms·
Suppose I had an implementation for a (MT safe) all in memory KV store based on tries, for example where the memory overhead is low -- certainly lower than hash
by scrubs 4y ago
Suppose I had an implementation for a (MT safe) all in memory KV store based on tries, for example where the memory overhead is low -- certainly lower than hashing. Is this something I can plug into FDB?
You write "giant hash map that will guarantee that items are in sorted order". Where can I get more info on that?
- hchaudhary 4y agoBoth keys and values in FoundationDB are simple byte strings and keys are treated as members of a total order, the lexicographic order over the underlying bytes, in which keys are sorted by each byte in order. You can see some more details about it here: https://apple.github.io/foundationdb/data-modeling.html https://apple.github.io/foundationdb/data-modeling.html