I was just curious to know a few opinions on how one would develop larbin to maintain website information. After analyzing the program, it seems to me that the hash function very often results in the same key for websites coming from the same host. For a large host, the likelihood that conflicts occur when in reality a url has not been visited before seems high. I was wondering if anyone agrees/disagrees with me. Would you alter the hash table if you were to attempt to actually maintain website information? If you did, how would you do it?
Thanks for the assistance.
mLammie
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I was just curious to know a few opinions on how one would develop larbin to maintain website information. After analyzing the program, it seems to me that the hash function very often results in the same key for websites coming from the same host. For a large host, the likelihood that conflicts occur when in reality a url has not been visited before seems high. I was wondering if anyone agrees/disagrees with me. Would you alter the hash table if you were to attempt to actually maintain website information? If you did, how would you do it?
Thanks for the assistance.
mLammie