Alternatives and similar repositories for emphf

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

• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 2 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆53Updated 7 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 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
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆262Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated last month
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago