Alternatives and similar repositories for poplar-trie

Users that are interested in poplar-trie are comparing it to the libraries listed below

• 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
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated last year
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last year
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 8 months 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
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 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
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• tlk00 / BitMagic
  BitMagic Library
  ☆429Updated last month
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆119Updated 5 years ago
• fjtapia / sort_parallel
  ☆13Updated 5 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated 2 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆83Updated 7 months ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆129Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆62Updated 5 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆48Updated 8 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