sfu-dis / corobaseLinks
Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
☆249Updated 3 years ago
Alternatives and similar repositories for corobase
Users that are interested in corobase are comparing it to the libraries listed below
Sorting:
- An adaptive radix tree for efficient indexing in main memory.☆163Updated last year
- ☆121Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- ☆150Updated 2 years ago
- HOT - Height Optimized Trie☆155Updated 7 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Updated 10 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 4 months ago
- Software Transactional Objects☆58Updated last year
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- Order-preserving key encoder☆124Updated 5 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆129Updated 5 months ago
- Key Value Store based on LevelDB☆114Updated 3 years ago
- ☆20Updated 2 years ago
- An embedded key-value store library specialized for building state machine and log store☆235Updated 3 weeks ago
- ☆290Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- Key/Value Datastore for Persistent Memory☆403Updated 2 years ago
- Quickstep project☆42Updated 10 months ago
- The Cicada engine☆59Updated 8 years ago
- pmwcas☆139Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆81Updated 3 years ago
- ☆72Updated 5 months ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆65Updated 4 months ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- Beta release of Masstree.☆444Updated last year