Implementing Hashing Using Separate Chaining in Java

Hashing is a very important and efficient tool in contemporary data processing particularly because of its influence in data storage and retrieval. This paper describes a form of hashing using separate chaining, in which linked lists are used to avoid hash collisions. The version presented uses the List interface and its LinkedList implementation present in java.util. In fact, this paper presents an object-oriented design of a hash table implemented in the Java programming language, in which separate chaining is used to resolve hash collisions, should any occur during the course of computation