Timeline for How does a hash table work?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2022 at 5:27 | history | edited | starball | CC BY-SA 4.0 |
denoise https://meta.stackexchange.com/q/131009/997587
|
| Jun 5, 2020 at 16:51 | comment | added | carozimm | @Jeach this is also so helpful, I've been looking around the internet for an intuitive explanation of hashing and this list of replies to the original question is great! | |
| Jan 15, 2019 at 15:10 | history | edited | David Cary | CC BY-SA 4.0 |
clarified (I hope) that the hash key is not always exactly 300.
|
| Sep 2, 2017 at 9:31 | review | Suggested edits | |||
| Sep 2, 2017 at 10:22 | |||||
| Jun 3, 2016 at 13:19 | history | edited | Jeach | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Jun 3, 2016 at 13:11 | comment | added | Jeach | @TonyD, I've changed the text to "they would module the hash key by 300", hoping it will be cleaner and clearer for everyone. Thanks! | |
| Jun 3, 2016 at 13:10 | history | edited | Jeach | CC BY-SA 3.0 |
deleted 5 characters in body
|
| Jun 2, 2016 at 21:20 | comment | added | Jeach | @TonyD, I'm not sure where the term "hash key" is referred in a conflicting matter? If so, please point out the two or more locations. Or are you saying that "we" use the term "hash key" while other sites such as Wikipedia uses "hash values, hash codes, hash sums, or simply hashes"? If so, who cares as long as the term used is consistent within a group or an organization. Programmers often use the "key" term. I would personally argue that another good option would be "hash value". But I would rule out using "hash code, hash sum or simply hashes". Focus on the algorithm and not the words! | |
| May 31, 2016 at 20:40 | comment | added | Jeach |
@TonyD, go to this site sha-1 online and generate a SHA-1 hash for TonyD that you type in the text field. You will end up with a generated value of something that looks like e5dc41578f88877b333c8b31634cf77e4911ed8c. This is nothing more than a large hexadecimal number of 160-bits (20-bytes). You can then use this to determine which bucket (a limited quantity) will be used to store your record.
|
|
| S Dec 28, 2014 at 19:53 | history | suggested | David | CC BY-SA 3.0 |
corrected arithmetic to measure effectiveness of hash table
|
| Dec 28, 2014 at 19:48 | review | Suggested edits | |||
| S Dec 28, 2014 at 19:53 | |||||
| Nov 7, 2014 at 15:30 | comment | added | ryantuck |
excellent description. except each filing cabinet would contain, on average, about 100 records (30k records / 300 cabinets = 100). Might be worth an edit.
|
|
| Apr 8, 2009 at 17:35 | history | edited | Jeach | CC BY-SA 2.5 |
added 606 characters in body
|
| Apr 8, 2009 at 17:29 | comment | added | Konrad Rudolph | You describe a specific type of hash table collision avoidance strategy, called variably “open addressing” or “closed addressing” (yes, sad but true) or “chaining”. There’s another type which doesn’t use list buckets but instead stores the items “inline”. | |
| Apr 8, 2009 at 17:20 | history | answered | Jeach | CC BY-SA 2.5 |