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
• ashvardanian / LibSee
  Link to this library and it will log all the LibC functions you are calling and how much time you are spending in them!
  ☆18Updated 5 months ago
• codepr / triedb
  Key-value store based on a trie data structure to handle the keyspace.
  ☆12Updated 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
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆36Updated last year
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 6 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• sysprog21 / buddy
  Buddy Memory Allocator
  ☆12Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• zakkak / cilk
  The CIlk programming language from http://supertech.lcs.mit.edu/cilk/
  ☆9Updated 9 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• plasma-umass / memory-landscape
  The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).
  ☆20Updated 4 years ago
• espindola / cthulhu
  ☆12Updated last year
• grivet / mpsc-queue
  A C11 implementation of D. Vyukov MPSC queue
  ☆29Updated last year
• sysprog21 / fiber
  A User Space Threading Library
  ☆19Updated last year
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• lwu / veb-tree
  A C++ implementation of cache-oblivious Van Emde Boas search trees
  ☆19Updated 7 years ago
• teivah / ettore
  A RISC-V virtual processor, written in Rust.
  ☆19Updated last year
• Mytherin / RembranDB
  Sample database with LLVM execution engine.
  ☆11Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago