ConcurrentHashMap does not resize itself

A DESCRIPTION OF THE PROBLEM :
Unlike a HashMap, ConcurrentHashMap does not resize itself as new elements are added. So if an initial size is incorrectly chosen the performance of the data structure will become O(log n).

A hash map with O(log n) performance defeats the whole purpose of using a hash map.