lemire / programmingishard

Related projects ⓘ

Alternatives and complementary repositories for programmingishard

• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 11 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 5 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆21Updated 3 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• lemire / talks
  Random material having to do with Daniel Lemire's talks
  ☆20Updated 6 months ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 7 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 4 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 7 months ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆44Updated 2 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 4 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆9Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 8 years ago