n3ko1 / ConcurrentSkipListLinks
generic, lock-free, concurrent skip list implementation
☆11Updated 2 years ago
Alternatives and similar repositories for ConcurrentSkipList
Users that are interested in ConcurrentSkipList are comparing it to the libraries listed below
Sorting:
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆107Updated 5 months ago
- An embedded key-value store library specialized for building state machine and log store☆237Updated last month
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- C++ implementation of raft consensus☆272Updated 2 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆82Updated 2 years ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆150Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- An update-in-place key-value store for modern storage.☆147Updated 2 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28Updated 8 months ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- Sphinx is a fast in-memory key-value store, compatible with Memcached.☆32Updated 6 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Couchbase Key-Value Engine☆145Updated this week
- Adaptive Radix Tree in C++☆50Updated this week
- ☆20Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- TSXor: A Simple Time Series Compression Algorithm☆53Updated 11 months ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆214Updated 2 years ago
- Quickstep project☆44Updated last year
- ☆125Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆76Updated 4 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Very fast lock-free queue (thread safe)☆179Updated 6 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago