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.
  ☆21Updated 9 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• rutgers-apl / TaskProf
  A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs
  ☆13Updated 7 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆72Updated 10 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.
  ☆45Updated 9 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 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 12 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆37Updated 2 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆56Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• rusnikola / wfe
  Wait-Free Eras (PPoPP '20)
  ☆10Updated 6 years ago
• abhinav-upadhyay / cmonkey
  C Implementation of the monkey programming language
  ☆75Updated 5 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• p-ranav / lexer
  Hackable Lexer with UTF-8 support
  ☆23Updated 6 years ago
• UTSASRG / Guarder
  ☆13Updated 7 years ago
• mcy / alkyne
  ☆25Updated 4 years ago
• dpt / Containers
  A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C
  ☆41Updated 3 months ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 6 years ago
• flouthoc / envelop.c
  Thread-less, event-loop based tiny http-server from scratch using epoll. Learning Purpose.
  ☆84Updated 4 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆76Updated 4 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆23Updated 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
• losfair / hexagon-e
  The HexagonE VM
  ☆26Updated 3 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆63Updated 6 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago