efficient / msls-evalLinks
Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
☆10Updated 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
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 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
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- ☆24Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- An Elastic, Tiered-Storage Service☆30Updated 6 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- The Cicada engine☆58Updated 8 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- S-Store Transactional Streaming Data Management System☆22Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014☆71Updated 10 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 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
- A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications☆95Updated 7 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 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 6 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago