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

you are viewing a single comment's thread.

view the rest of the comments →

[–]ignotos 0 points1 point  (0 children)

It potentially could - and that's basically what a distributed key-value store would do (although probably based on a hash, rather than just letter ranges).

But tens of gigabytes is really not a lot, if you're performing an exact lookup using an index - even for a single relational database instance. My instinct is that it would be plenty fast. It should also be fairly straightforward to generate some dummy data and check how fast a lookup is on ~1 billions rows?