now here we go,


divide your memory space into N buckets(logicall division) where N is a suitable Prime number.i.e. first bucket logically starts from address 0, second bucket from S/N, , tird from 2S/N and so on where S is your total memory space.

when ever a string arrives you divide your customer identification number with N, and store this string to the bucket number k%N where k is customer identification number.

to search a string Ks divide this with N and earch the string in bucket Ks%N. this is how theoritically hashing will work, here we assumed that strings stored have uniformly distributed over the search space. A condition "Bucket overflow occurs when string belonging to same buckets arrive and one buckets becomes full while others are empty. to resolve this many techneques are there. you can refer to ant data structure text book.


abhishek