efficient / msls-evalLinks
Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
☆11Updated 9 years ago
Alternatives and similar repositories for msls-eval
Users that are interested in msls-eval are comparing it to the libraries listed below
Sorting:
- LSM-trie☆114Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 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
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 5 years ago
- NVM key-value store API lIbrary repository.☆89Updated 11 years ago
- The Cicada engine☆59Updated 8 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- ☆24Updated 10 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
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆209Updated 9 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
- S-Store Transactional Streaming Data Management System☆22Updated 5 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014☆71Updated 10 years ago
- FOEDUS main source code repository☆63Updated 8 years ago
- An Elastic, Tiered-Storage Service☆30Updated 6 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Persistent Memory Graph Database☆43Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Yesquel: scalable SQL storage for Web apps☆42Updated 8 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- Eris distributed transactions☆52Updated 7 years ago
- Apache Quickstep Incubator - This project is retired☆95Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago