Alternatives and similar repositories for ConcurrentSkipList

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

• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆105Updated last month
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆164Updated last year
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆235Updated last month
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆26Updated 4 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆81Updated 2 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• rigtorp / HashMap
  An open addressing linear probing hash table, tuned for delete heavy workloads
  ☆210Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated 2 weeks ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• couchbase / kv_engine
  Couchbase Key-Value Engine
  ☆141Updated this week
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆149Updated 5 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 6 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated last month
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• shreyas-gopalakrishna / Concurrent-Skip-list
  The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operat…
  ☆25Updated 4 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆267Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆144Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆284Updated 3 weeks ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago