Retroactive data structure
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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
Text derived from https://en.wikipedia.org/w/index.php?oldid=1131418102 under CC BY-SA 4.0; modifications have been made.