HewlettPackard / foedusLinks
FOEDUS: Fast Optimistic Engine for Data Unification Services
☆65Updated 8 years ago
Alternatives and similar repositories for foedus
Users that are interested in foedus are comparing it to the libraries listed below
Sorting:
- FOEDUS main source code repository☆63Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- The Cicada engine☆59Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- Multicore in-memory storage engine☆393Updated 7 years ago
- Beta release of Masstree.☆445Updated last year
- Atlas: Programming for Persistent Memory☆76Updated 4 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆209Updated 9 years ago
- Persistent Memory Storage Engine☆24Updated 10 months ago
- ☆149Updated 2 years ago
- pmwcas☆138Updated 2 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆30Updated 6 years ago
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 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
- NOPaxos consensus protocol☆137Updated 4 years ago
- ☆15Updated 8 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Concurrency Control Benchmark☆48Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- NVM key-value store API lIbrary repository.☆89Updated 11 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Apache Quickstep Incubator - This project is retired☆95Updated 6 years ago