Alternatives and similar repositories for diskhash

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

• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆265Updated 2 months ago
• ot / succinct
  A collection of succinct data structures
  ☆209Updated last year
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 11 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 11 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆188Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆106Updated 8 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆87Updated 4 years ago
• mavam / libbf
  Bloom filters for C++11
  ☆363Updated 3 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated 5 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆69Updated 9 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 8 years ago
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆302Updated 3 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago