unordered_map vs vector with int keys

What is the difference in performance between using an unordered_map or a vector when the keys are integers. I have around 100-1000 elements which have continuous id that I can use to access a vector. The reason to use a hash table is that is more convenient to index by the objects themselves.

Note that I ask it as a general question, no as a code specific one.