naskitis / B-trie

Related projects ⓘ

Alternatives and complementary repositories for B-trie

• naskitis / HAT-trie
  The HAT-trie, written in C, as described in my PhD thesis.
  ☆19Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• kurocha / concurrent
  ☆13Updated last year
• WojciechMula / parsing-int-series
  Parse multiple decimal integers separated by arbitrary number of delimiters
  ☆34Updated 9 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• LPD-EPFL / lockin
  LOCKIN is a locking library with various lock algorithms implemented in header files for ease of use
  ☆10Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• codepr / triedb
  Key-value store based on a trie data structure to handle the keyspace.
  ☆12Updated 5 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.
  ☆40Updated 8 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆15Updated 10 years ago
• mattgodbolt / cpponsea-2019
  Slides for my 2019 presentation at C++ on Sea
  ☆13Updated 3 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 7 years ago
• 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
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆27Updated 8 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆44Updated 11 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• tabokie / coplus
  Parallel programming library in C++11
  ☆12Updated 4 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆16Updated 5 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• zakkak / cilk
  The CIlk programming language from http://supertech.lcs.mit.edu/cilk/
  ☆9Updated 9 years ago