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
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 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.
  ☆43Updated 9 years ago
• kurocha / concurrent
  ☆13Updated 2 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆70Updated 10 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• rutgers-apl / TaskProf
  A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs
  ☆13Updated 7 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• julienschmidt / moderndbs
  Basic Database System implemented for MDBS course
  ☆13Updated 11 years ago
• rusnikola / wfe
  Wait-Free Eras (PPoPP '20)
  ☆10Updated 5 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆93Updated 2 years ago
• angrave / SystemProgrammingProjects
  System Programming Project Ideas and Information for honors students
  ☆20Updated 10 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆55Updated 10 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(…
  ☆50Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆37Updated last year
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated 2 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rain-1 / awesome-allocators
  Awesome links and information about memory allocation
  ☆181Updated 6 years ago
• Bazist / HArray
  Fastest Trie structure (Linux & Windows)
  ☆93Updated 2 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
• aprell / tasking-2.0
  Tasking 2.0
  ☆16Updated 4 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆156Updated last year