dotnwat / awesome-seastarLinks
A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
☆104Updated 9 months ago
Alternatives and similar repositories for awesome-seastar
Users that are interested in awesome-seastar are comparing it to the libraries listed below
Sorting:
- An embedded key-value store library specialized for building state machine and log store☆233Updated 3 weeks ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- ☆137Updated 3 years ago
- A Raft Library in C++ based on the Raft implementation in Apache Kudu☆134Updated this week
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆20Updated 2 years ago
- Embedded InnoDB based on v5.1☆32Updated last week
- AnyBlob - A Universal Cloud Object Storage Download Manager Built For Cost-Throughput Optimal Analytics!☆130Updated 2 weeks ago
- a high performance cache simulator and library☆106Updated 10 months ago
- An update-in-place key-value store for modern storage.☆142Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Adaptive Radix Tree in C++☆45Updated last month
- Fast Approximate Membership Filters (C++)☆279Updated 6 months ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆123Updated 9 months ago
- Order-preserving key encoder☆123Updated 5 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆74Updated last year
- ☆27Updated 3 years ago
- ☆51Updated 7 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆61Updated 2 months ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆24Updated 2 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆558Updated 3 weeks ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆154Updated 6 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆49Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago