Partitioning concurrent HashMap

Question

I need to store some values category wise in key-value pair in cache,for eg: category1 = {(k1,v1),(k2,v2)} category1 = {(k3,v3),(k4,v4)}

which can be accessed concurrently. I am looking like partitioning the concurrent HashMap, but dont know exactly what data structure to use. Any idea?, Thanks

try this [link](http://stackoverflow.com/questions/510632/whats-the-difference-between-concurrenthashmap-and-collections-synchronizedmap) — Ken de Guzman, Sep 05 '14 at 06:56
What about ArrayList of Map, where each map is a category. and arraylist is container — Gaurav Gupta, Sep 05 '14 at 07:08

score 0 · Accepted Answer · answered Sep 05 '14 at 07:13

0

This may be useful for you,

ArrayList<Map> categoryWrapperList = new ArrayList<Map>();
Map category1 = new HashMap<Integer, Integer>();
category1.put(1, 2);
category1.put(2, 3);
Map category2 = new HashMap<Integer, Integer>();
category2.put(11, 2);
category2.put(21, 3);
categoryWrapperList.add(category1);
categoryWrapperList.add(category2);

Here, Arraylist will store all the categories, and you can put any value in the category. you, obviously can see more about ArrayList for time consumption by arraylist in various operations(like get, search etc).

answered Sep 05 '14 at 07:13

Gaurav Gupta

4,586
4
39
72

we can use map within map, – user3363969 Sep 05 '14 at 07:18
Is this a question or suggestion? If question, then yes you can. – Gaurav Gupta Sep 05 '14 at 07:20

Partitioning concurrent HashMap

1 Answers1