stephentu / scalexLinks
Code snippets for the workshop on concurrent data structure implementation.
☆31Updated 12 years ago
Alternatives and similar repositories for scalex
Users that are interested in scalex are comparing it to the libraries listed below
Sorting:
- Read- and latency-optimized log structured merge tree☆174Updated 13 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
- The Cicada engine☆57Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- NOPaxos consensus protocol☆136Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- ☆121Updated 3 years ago
- Benchmark of common hash functions☆36Updated 5 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆75Updated 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
- An open-source BzTree implementation☆92Updated 4 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Persistent Memory Storage Engine☆24Updated 8 months ago
- ☆149Updated 2 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A fast in-memory key-value store☆49Updated 7 years ago