Construct · 1 fields · 1 citations

persistent data structure: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Analysis of algorithms

a data structure that keeps all earlier versions available for access or update after each change, built with small overhead.

In analysis of algorithms, persistent data structure refers to a data structure that keeps all earlier versions available for access or update after each change, built with small overhead. This meaning comes from Driscoll (1989) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how persistent data structure sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

structure4 fields · 5 citationsjingle · one word, four constructs

References

Driscoll, J. R., Sarnak, N., Sleator, D. D., & Tarjan, R. E. (1989). Making data structures persistent. Journal of Computer and System Sciences, 38(1), 86-124. https://doi.org/10.1016/0022-0000(89)90034-2

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct