Scientists Find Optimal Balance of Data Storage and Time

• perfecthash

  2 60 0.7 C

  A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.

Hey, if you're looking for a real-world pragmatic and performant implementation of a theoretically-cool algorithm, my https://github.com/tpn/perfecthash project might fit the bill.

It's geared to generating perfect hash tables with the fastest possible lookup/index times (for 32-bit keys), for key sets in the <=100,000 range. (It scales well up to millions of keys, but the solving time takes a lot longer.)

• rust-boomphf

  1 124 2.7 Rust

  Fast and scalable minimal perfect hashing for massive key sets

  

My hunch is that boomphf will outperform and also supports any key type: https://github.com/10XGenomics/rust-boomphf

Construction is ~10m keys/s on old hardware and uses very few bits per key.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• iceberghashtable

  1 47 5.9 C
  

Here is the code https://github.com/splatlab/iceberghashtable

(from https://prashantpandey.github.io/publication/sigmod23_iceber...)

Need to compare it against my other concurrent hash tables, as they measured only 64bit int performance for keys and values, which is a bit unrealistic.

Suggest a related project