awmarthur

(OP) I'm mostly interesting in a fast hash for writing a generic, concurrent hash map.

The reference to Tries came from the original issue in the Golang repo about possible uses for a standard library hash function: https://github.com/golang/go/issues/21195

And you're right, the Trie implementation linked there was indeed a Hash-Array Mapped Tried: https://pkg.go.dev/github.com/lleo/go-hamt-key#Key

related and useful: "Ribbon filter: Practically smaller than Bloom and Xor" (https://arxiv.org/abs/2103.02515)

This paper does a good job of showing the space/time tradeoffs of various approximate sets.

That sounds somewhat similar to Dolt's storage index structure: Prolly Trees https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-tabl...

Dolt is 'Git for Data'.

It's a tool to create SQL databases that you can push, pull, diff, branch, and merge. I created a Dolt repository to track the National Vulnerability Database. You can use SQL queries to find the latest security bugs, what software they affect, and how severe the issue is.

Try it out:

brew install dolt

dolt clone Liquidata/NVD

dolt sql -x "New CVEs Today"