Alternatives and similar repositories for btrees

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

• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆104Updated 6 years ago
• brianwatling / libfiber
  A User Space Threading Library Supporting Multi-Core Systems
  ☆141Updated 2 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆80Updated 11 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 14 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆193Updated 3 months ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• ldionne / mpl11
  Enjoy template metaprogramming
  ☆115Updated 9 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• memsql / lockfree-bench
  Benchmarks for lockfree datastructures.
  ☆120Updated 11 years ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆109Updated 7 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• Beman / btree
  Proposed B-tree library for Boost.org
  ☆71Updated 11 years ago
• icnc / icnc
  Intel(R) Concurrent Collections for C++
  ☆116Updated 3 years ago
• google / dimsum
  Portable C++ SIMD library
  ☆171Updated 6 years ago
• pgoodman / rcu
  C++ implementation of RCU based on reference counting and hazard pointers.
  ☆28Updated 13 years ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆85Updated 10 years ago
• NickStrupat / Aligned
  Memory alignment wrappers, useful for avoiding false sharing
  ☆41Updated 9 years ago
• goldsborough / lru-cache
  A feature complete LRU cache implementation in C++
  ☆264Updated 6 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆213Updated 2 years ago