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. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Davoodi, P., Fineman, J. T., Iacono, J., & Özkan, Ö. (2014). Cache-oblivious persistence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 296–308). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
