Alternatives and similar repositories for xorfilter_cpp:

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

• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆11Updated 10 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• espindola / cthulhu
  ☆12Updated last year
• ConorStokes / bitable
  A simple immutable ordered key/value storage system.
  ☆15Updated 9 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 5 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• kurocha / concurrent
  ☆13Updated last year
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆13Updated 4 years ago
• skarupke / reflection
  ☆31Updated 9 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• skal65535 / fsc
  Finite State Coder
  ☆14Updated 10 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• MartinezTorres / marlin
  Marlin: high throughput entropy compressor
  ☆30Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago