Cache-Oblivious Persistence

TL;DR

This paper introduces a novel transformation that enables cache-oblivious data structures to be made partially persistent, allowing queries on any past state within a multi-level memory hierarchy.

Contribution

It presents the first general method to achieve partial persistence in cache-oblivious data structures, bridging a gap in the existing models.

Findings

First general transformation for cache-oblivious partial persistence

Enables efficient queries on past states in multi-level memory hierarchies

Advances the integration of persistence with cache-oblivious models

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.