Alternatives and similar repositories for xorfilter_cpp:

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

• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆11Updated 10 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• kurocha / concurrent
  ☆13Updated last year
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 4 months ago
• r-lyeh-archived / journey
  Lightweight append-only, header-less, journaling file format (C++11)
  ☆13Updated 9 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• chriso / bitset
  A compressed bitset with supporting data structures and algorithms
  ☆19Updated 11 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 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
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 5 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• chriso / columnix
  Columnar storage and query engine
  ☆9Updated 6 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• ConorStokes / bitable
  A simple immutable ordered key/value storage system.
  ☆15Updated 9 years ago
• espindola / cthulhu
  ☆12Updated last year
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• Const-me / MemoryAccessCosts
  ☆13Updated 6 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(…
  ☆49Updated 11 months ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• willemt / skiplist
  Dictionary implemented through a skiplist
  ☆15Updated 10 years ago