Outer Web | Explore

/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		blog.demofox.org O(1) Data Lookups With Minimal Perfect Hashing « The blog at the bottom of the sea
\|	\|	randorithms.com Minimal perfect hash functions - Randorithms	1.9 parsecs away Travel
\|	\|	If you want to observe a hash function in the wild, all you need to do is look under the hood of the nearest key-value store. Hashing is a fundamentally simp...	1.9 parsecs away Travel
\|	\|	benhoyt.com How to implement a hash table (in C)	2.7 parsecs away Travel
\|	\|	An explanation of how to implement a simple hash table data structure, with code and examples in the C programming language.	2.7 parsecs away Travel
\|	\|	codecapsule.com Implementing a Key-Value Store - Part 5: Hash table implementations \| Code Capsule	2.8 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	2.8 parsecs away Travel
\|	\|	bannalia.blogspot.com Bannalia: trivial notes on themes diverse: Inside boost::unordered_flat_map	16.7 parsecs away Travel
\|		Introduction The case for open addressing SIMD-accelerated lookup boost::unordered_flat_map data structure Rehashing Hash post-mixing Sta...	16.7 parsecs away Travel