Alternatives and similar repositories for xcdat

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

• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆250Updated 3 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆34Updated 10 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated last month
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆48Updated 10 years ago
• kampersanda / cda-tries
  Compressed double-array tries for static string dictionaries
  ☆11Updated 6 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆15Updated 4 years ago
• WojciechMula / simd-string
  SIMD (SSE) string functions
  ☆103Updated 8 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆68Updated 2 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆63Updated 6 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆103Updated 3 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆57Updated 3 years ago