问题
I need a way to do key-value lookups across (potentially) hundreds of GB of data. Ideally something based on a distributed hashtable, that works nicely with Java. It should be fault-tolerant, and open source.
The store should be persistent, but would ideally cache data in memory to speed things up.
It should be able to support concurrent reads and writes from multiple machines (reads will be 100X more common though). Basically the purpose is to do a quick initial lookup of user metadata for a web-service.
Can anyone recommend anything?
回答1:
You might want to check out Hazelcast. It is distributed/partitioned, super lite, easy and free.
java.util.Map map = Hazelcast.getMap ("mymap");
map.put ("key1", "value1");
Regards,
-talip
回答2:
Open Chord is an implementation of the CHORD protocol in Java. It is a distributed hash table protocol that should fit your needs perfectly.
回答3:
Depending on the use case, Terracotta may be just what you need.
回答4:
You should probably specify if it needs to be persistent or not, in memory or not, etc. You could try: http://www.danga.com/memcached/
回答5:
Distributed hash tables include Tapestry, Chord, and Pastry. One of these should suit your needs.
回答6:
OpenChord sounds promising; but i'd also consider BDB, or any other non-SQL hashtable, making it distributed can be dead-easy (if the number of storage nodes is (almost) constant, at least), just hash the key on the client to get the appropriate server.
回答7:
Open Source Cache Solutions in Java
Oracle Coherence (used to be Tangosol)
JCache JSR
回答8:
nmdb sounds like its exactly what you need. Distributed, in memory cache, with a persistent on-disk storage. Current back-ends include qdbm, berkeley db, and (recently added after a quick email to the developer) tokyo cabinet. key/value size is limited though, but I believe that can be lifted if you don't need TICP support.
回答9:
Try distributed Map structure from Redisson, it based on Redis server. Using Redis cluster configuration you may split data across 1000 servers.
Usage example:
Redisson redisson = Redisson.create();
ConcurrentMap<String, SomeObject> map = redisson.getMap("anyMap");
map.put("123", new SomeObject());
map.putIfAbsent("323", new SomeObject());
map.remove("123");
...
redisson.shutdown();
回答10:
DNS has the capability to do this, I don't know how large each one of your records is (8GB of tons of small data?), but it may work.
来源：https://stackoverflow.com/questions/198006/need-a-distributed-key-value-lookup-system