Semi-persistent Data Structures
No abstract available.
Related papers
- Understand the overheads of storage data structures on persistent memory PPoPP 2020
- A context-free markup language for semi-structured text PLDI 2010
- FlashRelate: extracting relational data from semi-structured spreadsheets using examples PLDI 2015
- Lightweight Testing of Persistent Amortized Time Complexity in the Credit Monad Haskell 2025
- Mirror: making lock-free data structures persistent PLDI 2021
- A persistent lock-free queue for non-volatile memory PPoPP 2018
- Persistence for the masses: RRB-vectors in a systems language ICFP 2017
- Persistent Iterators with Value Semantics PLDI 2026