/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

 azdavis.net
Hash map cost bounds
| | benhoyt.com
How to implement a hash table (in C)

An explanation of how to implement a simple hash table data structure, with code and examples in the C programming language.
111.1 parsecs

Travel
| |
| | dave.cheney.net
How the Go runtime implements maps efficiently (without generics) | Dave Cheney

[AI summary] The post explains how the Go runtime implements efficient hashmaps without generics by using a unique maptype descriptor and compile time rewriting to bridge the gap between generic behavior and type safety.
52.6 parsecs

Travel
| |
| | algorithmsoup.wordpress.com
A Hash Table that Uses Less Space Than the Items that it Stores - Algorithm Soup

When people talk about "space-efficient hash tables'', they are usually talking about the following type of guarantee: If we are storing $latex n$ keys, each of which are $latex w$ bits, then the total space usage should be $latex (1 + \epsilon)wn$ bits for some small $latex \epsilon$. But, what if I told you we...
47.6 parsecs

Travel
| |
| | surfingcomplexity.blog
Extending MVCC to be serializable, in TLA+ - Surfing Complexity

In the previous blog post, we saw how a transaction isolation strategy built on multi-version concurrency control (MVCC) does not implement the serializable isolation level. Instead, it implements a weaker isolation level called snapshot isolation. In this post, I'll discuss how that MVCC model can be extended in order to achieve serializability, based on work...
99.0 parsecs

Travel
|