Any concurrent maps with better performance than ConcurrentHashMap?

Question

I understand that ConcurrentHashMap implements the backing table as multiple segment arrays rather than a single array to improve concurrent access performance. Are there any other Map implementations in java that've better performance in a concurrent environment than ConcurrentHashMap?

Answer 1

A ConcurrentSkipListMap is more tolerant of extremely high volume changes than a ConcurrentHashMap, but its amortized lookup time is O(log(n)) rather than O(1).

So, as with all data structures, "best performance" depends on your usage pattern and definition of "performance."