HashMap vs Berkely DB
I am using a HashMap<String, String> to store lots of entries. For example, each entry will cost less 700 bytes so that storing 600,000 entries will take about 400,000 kilobytes memory, fair enough. But I wonder Berkel DB will use less memory and faster with this much of data. Any input will help!