Difference between Hashmap and HashTable in Java

HashMap and the Hashtable used to store data in key and value form. Both are using the hashing technique to store unique keys. But there are many differences between HashMap and Hashtable classes that are given below.

HashMap

1) HashMap is non-synchronized. It is not-thread safe and can’t be shared between many threads without proper synchronization code.
2) HashMap allows one null key and multiple null values.
3) HashMap is a new class introduced in JDK 1.2.
4) HashMap is fast.
5) We can make the HashMap as synchronized by calling this code
Map m = Collections.synchronizedMap(HashMap);
6) HashMap is traversed by Iterator.
7) Iterator in HashMap is fail-fast.
8) HashMap inherits AbstractMap class.

Hashtable

1) Hashtable is synchronized. It is thread-safe and can be shared with many threads.
2) Hashtable doesn’t allow any null key or value.
3) Hashtable is a legacy class.
4) Hashtable is slow.
5) Hashtable is internally synchronized and can’t be unsynchronized.
6) Hashtable is traversed by Enumerator and Iterator.
7) Enumerator in Hashtable is not fail-fast.
8) Hashtable inherits Dictionary class.

Further reading What is difference between HashMap and Hashtable in Java?

enter image description here

Leave a Reply

Your email address will not be published. Required fields are marked *