UNMhash
Recommendation |
Not Recommended |
||||
Link |
http://www.eece.unm.edu/faculty/heileman/hash/code/hash.html |
||||
Delivery Method |
Java Applet |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
BJ Smith; GL Heilman; CT Abdallah |
||||
Institution |
University of New Mexico |
||||
Project |
|||||
Works |
Yes |
||||
Description |
This tool is in the form of a Java Applet that lets the user experiment and compare exponential and double hashing on the clustered data. The user can input a cluster size between 1% and 100%, and a table size between 100 and 10,000 elements. On pressing the run button two hash tables (one for exponential hashing and one for double hashing) are created each filled to 95% capacity. The applet also provides a “Graph” button, which lets you compare the number of probes required at different points, in form of a line graph, on way to filling the Hash table to 95% capacity. The tool is highly compact, and can be used to see the just number of Probes required for each Hashing Algorithm i.e. Exponential and Double hashing that fills the hash table at different capacities, say 5%, 10%, 15%,….95%. |
||||
Evaluation |
Limited usefulness. Doesn't really demonstrate any hashing algorithms, but rather shows performance under a rather specialized set of circumstances. While showing performance data is a good thing to encourage in AVs, in this case this AV needs better explanation of what is being described. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2007-10-25 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
1996 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
