Cache-oblivious persistence

DOI10.1007/978-3-662-44777-2_25MaRDI QIDQ2921414zbMATH OpenOpenAlexFDO

Authors Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan

Publication date 8 October 2014

Published in Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5492

Mathematics Subject Classification ID

Data structures (68P05)

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.

Recommendations

• Making data structures persistent
• scientific article; zbMATH DE number 2086622
• Making data structures confluently persistent
• Confluent persistence revisited
• Partially persistent B-trees with constant worst case update time

Cited in

(1)

• Fully persistent B-trees

This page was built for publication: Cache-oblivious persistence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921414)