Alternatives and similar repositories for TVLLib

Users that are interested in TVLLib are comparing it to the libraries listed below

• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆137Updated 2 weeks ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆182Updated 8 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆37Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago