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
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 5 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆44Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014☆71Updated 11 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- The Cicada engine☆59Updated 8 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 15 years ago
- S-Store Transactional Streaming Data Management System☆22Updated 5 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
- Algorithms to compress sorted arrays of integers☆19Updated 11 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- ☆24Updated 11 years ago
- NVM key-value store API lIbrary repository.☆90Updated 11 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Quickstep Project☆27Updated 6 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- ☆27Updated 8 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- Apache Quickstep Incubator - This project is retired☆94Updated 7 years ago
- a quotient filter written in C☆88Updated 8 years ago