/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 probablydance.com
I Wrote The Fastest Hashtable | Probably Dance
| | maksimkita.com
Hash Tables
5.1 parsecs away

Travel
| |
| | codecapsule.com
Implementing a Key-Value Store - Part 5: Hash table implementations | Code Capsule
5.0 parsecs away

Travel
| | This is Part 5 of the IKVS series, "Implementing a Key-Value Store". You can also check the Table of Contents for other parts. In this article, I will study the actual implementations of hash tables in C++ to understand where are the bottlenecks. Hash functions are CPU-intensive and should be optimized for that. However, most of the
| | tenthousandmeters.com
Python behind the scenes #10: how Python dictionaries work
6.0 parsecs away

Travel
| | Python dictionaries are an extremely important part of Python. Of course they are important because programmers use them a lot, but that's not the...
| | blog.demofox.org
O(1) Data Lookups With Minimal Perfect Hashing « The blog at the bottom of the sea
12.8 parsecs away

Travel
| Hash tables are great in that you can hash a key and then use that hash as an index into an array to get the information associated with that key. That is very fast, so long as you use a fast hash function. The story doesn't end there though because hash functions can have collisions...