Cache-Oblivious Persistence
Data Structures and Algorithms
2014-07-02 v2
Abstract
Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.We present the first general transformation for making cache-oblivious model data structures partially persistent.
Cite
@article{arxiv.1402.5492,
title = {Cache-Oblivious Persistence},
author = {Pooya Davoodi and Jeremy T. Fineman and John Iacono and Özgür Özkan},
journal= {arXiv preprint arXiv:1402.5492},
year = {2014}
}