哈希地图空间和性能问题 [英] Issue with Hash Map Space and Performance

问题描述

我必须在我的HashMultiMap中存储超过1亿个键值（键可以有多个值）。任何人都可以帮助我更快地存储和搜索：

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）东京内阁

3） H2

4） EhCache

5）或任何人

另一点，那些与内存中哈希映射大致相同的性能？一点指导会更有帮助。谢谢。

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.

推荐答案

我建议 Redis 。它更像是一个数据结构存储而不是其他存储（例如它支持地图和集合），并且只需要很少的努力就可以开始使用。令人难以置信的是
简单易用，并且有一个很棒的 Java API 。

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.

这篇关于哈希地图空间和性能问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！