yoavz1997 / Efficient-Lock-Free-Durable-Sets
Code for "Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient Lock-Free Durable Sets, OOPSLA 2019" (https://dl.acm.org/doi/10.1145/3360554)
☆19Updated 5 years ago
Alternatives and similar repositories for Efficient-Lock-Free-Durable-Sets:
Users that are interested in Efficient-Lock-Free-Durable-Sets are comparing it to the libraries listed below
- ☆27Updated 2 years ago
- ☆28Updated 3 years ago
- Passive Disaggregated Persistent Memory at USENIX ATC 2020.☆51Updated 4 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- ☆30Updated 9 years ago
- ☆26Updated 4 years ago
- ☆35Updated 2 years ago
- ☆25Updated 8 years ago
- A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)☆29Updated 6 years ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆50Updated 6 months ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆23Updated 3 years ago
- NVM Database from Carnegie-Mellon U☆24Updated 4 years ago
- This repository contains the source code for our ACM SIGMOD '21 paper (Maximizing Persistent Memory Bandwidth Utilization for OLAP Worklo…☆21Updated 2 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆20Updated 2 years ago
- ☆14Updated 2 years ago
- ☆12Updated 2 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- ☆18Updated 5 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated last year
- Range Optimized Adaptive Radix Tree☆22Updated last year
- Strata: A Cross Media File System☆70Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆74Updated last year
- ☆57Updated 3 years ago
- ☆15Updated 7 years ago
- ☆47Updated 4 years ago
- 2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…☆24Updated 5 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago