Alternatives and similar repositories for emphf

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

• fclaude / libcds2
  Compact Data Structures Library
  ☆103Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆274Updated 6 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆115Updated last month
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆132Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated last month
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆108Updated 11 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆190Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆104Updated 6 years ago