Alternatives and similar repositories for benchmphf

Users that are interested in benchmphf are comparing it to the libraries listed below

• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆33Updated 7 months ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• bonitao / cmph
  ☆20Updated 3 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• intel / zlib
  ☆144Updated last year
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated this week
• tlk00 / BitMagic
  BitMagic Library
  ☆426Updated 4 months ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 7 months ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆232Updated 4 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 5 months ago