Alternatives and similar repositories for libart:

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

• willemt / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆1,135Updated last year
• kohler / masstree-beta
  Beta release of Masstree.
  ☆438Updated last year
• antirez / rax
  A radix tree implementation in ANSI C
  ☆1,130Updated last year
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆292Updated 2 years ago
• utsaslab / pebblesdb
  The PebblesDB write-optimized key-value store (SOSP 17)
  ☆508Updated 9 months ago
• agl / critbit
  Critbit trees in C
  ☆332Updated 3 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆286Updated 4 years ago
• RoaringBitmap / CRoaring
  Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, and StarRocks
  ☆1,595Updated last month
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆287Updated 5 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆497Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆381Updated 7 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…
  ☆178Updated 7 years ago
• smfrpc / smf
  Fastest RPC in the west
  ☆724Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆246Updated 4 years ago
• canonical / raft
  Unmaintained C implementation of the Raft consensus protocol
  ☆943Updated 10 months ago
• efficient / libcuckoo
  A high-performance, concurrent hash table
  ☆1,629Updated 2 months ago
• concurrencykit / ck
  Concurrency primitives, safe memory reclamation mechanisms and non-blocking (including lock-free) data structures designed to aid in the …
  ☆2,433Updated this week
• percona / PerconaFT
  PerconaFT is a high-performance, transactional key-value store
  ☆560Updated 10 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 10 months ago
• HdrHistogram / HdrHistogram_c
  C port of the HdrHistogram
  ☆241Updated 2 months ago
• simonhf / sharedhashfile
  Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
  ☆465Updated 4 years ago
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆459Updated 8 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆273Updated last month
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆252Updated 4 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆357Updated last week
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆398Updated last year
• mintomic / mintomic
  [deprecated] For native C atomics, see Turf instead
  ☆517Updated 8 years ago
• fast-pack / FastPFor
  The FastPFOR C++ library: Fast integer compression
  ☆897Updated last week