efficient / cicadaLinks
Dependably fast multi-core in-memory transactions
☆20Updated 7 years ago
Alternatives and similar repositories for cicada
Users that are interested in cicada are comparing it to the libraries listed below
Sorting:
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 7 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 5 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- ☆12Updated 4 years ago
- ☆12Updated 6 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- The Cicada engine☆57Updated 8 years ago
- Rust bindings for SPDK☆19Updated 7 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Diamond reactive programming platform☆25Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ☆14Updated 2 years ago
- A project to implement Augmented Time☆50Updated 11 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- ☆20Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- A simple, reference implementation of a B^e-tree☆154Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Rust bindings for the NVM Library http://pmem.io☆16Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago