IntelLabs / pmgdLinks
Persistent Memory Graph Database
☆43Updated 2 years ago
Alternatives and similar repositories for pmgd
Users that are interested in pmgd are comparing it to the libraries listed below
Sorting:
- The Cicada engine☆57Updated 8 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- An Elastic, Tiered-Storage Service☆30Updated 6 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 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
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Quickstep project☆42Updated 8 months ago
- Atlas: Programming for Persistent Memory☆76Updated 4 years ago
- ☆82Updated 7 years ago
- Multi-core Window-Based Stream Processing Engine☆72Updated 3 years ago
- ☆28Updated 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
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago