Explore >> Select a destination

You are here

 blog.demofox.org
O(1) Data Lookups With Minimal Perfect Hashing « The blog at the bottom of the sea
| | clickhouse.com
Hash tables in ClickHouse and C++ Zero-cost Abstractions
2.9 parsecs away

Travel
| | Read about how we implement hash tables in ClickHouse from choosing the right hash function, to managing collisions, benchmarking and designing an elegant API. All for the fastest hash table implementation possible.
| | 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.
| | 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
| | my-it-notes.com
Hash (mis)usage: tales from the prod - ??? IT-???????
16.9 parsecs away

Travel
| Few observations in regards to hash usage, in projects where data volume and spikes in load shift engineering from the KISS paradigm to the extent where you have to really care about underlying technologies and data structures. There are different hash functions tailored for different use cases - quick pattern matching in Rabin-Karp algorithm, prefix ...