Search code examples
javaehcacheh2berkeley-dbtokyo-cabinet

Issue with Hash Map Space and Performance

I have to store more than 100 millions of key-values in my HashMultiMap (key can have multiple values). Can anybody help me which one is faster for both storing and searching:

1) Berkeley DB

2) Tokyo Cabinet

3) H2

4) EhCache

5) Or anyothers

Another point, is performance of those approximately identical to in-memory hash map ? A little bit guidance will be more helpful. Thanks.

NB: information about any one of these is also helpful.

Solution

  • I'd recommend Redis. It's more of a data structure store than the others (e.g. it supports maps and sets) and requires very little effort to get started with. It's incredibly simple to use and has a great Java API.

    I'd start by looking at the functions here that allow you to associate a key with a group of values.