Alternatives and similar repositories for B-trie

Users that are interested in B-trie are comparing it to the libraries listed below

• naskitis / HAT-trie
  The HAT-trie, written in C, as described in my PhD thesis.
  ☆20Updated 8 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆66Updated 9 years ago
• PumpkinDB / rust-spdk
  Rust bindings for SPDK
  ☆19Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• chriso / columnix
  Columnar storage and query engine
  ☆9Updated 7 years ago
• rusnikola / wfe
  Wait-Free Eras (PPoPP '20)
  ☆10Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 6 years ago
• rutgers-apl / TaskProf
  A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs
  ☆13Updated 7 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• LPD-EPFL / lockin
  LOCKIN is a locking library with various lock algorithms implemented in header files for ease of use
  ☆10Updated 8 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 11 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• olibre / B-Queue
  An efficient and practical queueing for fast core-to-core communication http://psy-lob-saw.blogspot.co.uk/2013/11/spsc-iv-look-at-bqueue.…
  ☆21Updated 8 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago