2014/02/22 by Pooya Davoodi, Jeremy T. Fineman, Davoodi, Pooya +5
Computer Science · #Data Structures and Algorithms (cs.DS) #E.1 #E.2 #F.2.2 #FOS: Computer and information sciences #cs.DS
paper · pdf · doi:10.48550/arxiv.1402.5492
arxiv created 2014/07/01 · arxiv updated 2014/07/02
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.