thomasmueller / xorfilter_cpp

Related projects ⓘ

Alternatives and complementary repositories for xorfilter_cpp

• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆11Updated 10 years ago
• skal65535 / fsc
  Finite State Coder
  ☆14Updated 9 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• stedolan / libfib
  A library for high-performance lightweight threads
  ☆20Updated 13 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• willemt / skiplist
  Dictionary implemented through a skiplist
  ☆15Updated 10 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• lemire / backward_multiplication
  Multiplying... backward?
  ☆13Updated 4 years ago
• skarupke / reflection
  ☆30Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• espindola / cthulhu
  ☆12Updated last year
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 6 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 5 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 …
  ☆21Updated 2 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆31Updated 9 years ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated this week
• skarupke / radix_sort
  ☆10Updated 7 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• stevedonovan / llib
  A compact library for C99 (and MSVC in C++ mode) providing refcounted arrays, maps, lists and a cool lexical scanner.
  ☆40Updated 7 years ago