1.The distribution should be uniform.
2.An ideal hash function should assign the same number of records in each bucket.
3.The distribution should be random.
4.Regardless of the actual search-keys, the each bucket has the same number of records on average
5.Hash values should not depend on any ordering or the search-keys