---
title: Retroactive data structure
slug: retroactive-data-structure
qid: 
snapshot: enwiki-001131418102
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1131418102
tags: [20363771, 22951509, 24043274]
---

# Retroactive data structure

> [!note] Provenance
> Snapshot `enwiki-001131418102` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1131418102> · Licensed CC BY-SA 4.0

In computer science a retroactive data structure is a data structure which supports efficient modifications to a sequence of operations that have been performed on the structure. These modifications can take the form of retroactive insertion, deletion or updating an operation that was performed at some time in the past.

In computer science a retroactive data structure is a data structure which supports efficient modifications to a sequence of operations that have been performed on the structure. These modifications can take the form of retroactive insertion, deletion or updating an operation that was performed at some time in the past. Any data structure can be reformulated in a retroactive setting. In general the data structure involves a series of updates and queries made over some period of time. Let U = [u t 1 , u t 2 , u t 3 , ..., u t m ] be the sequence of update operations from t 1 to t m such that t 1 2 m . The assumption here is that at most one operation can be performed for a given time t. ==See also== Persistent data structure ==References==
