Definition: A data structure that preserves its old versions, that is, previous versions may be queried in addition to the latest version.
Specialization (... is a kind of me.)
partially persistent data structure, fully persistent data structure, confluently persistent data structure.
Note: From Algorithms and Theory of Computation Handbook, page 5-24, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan, Making Data Structures Persistent, Journal of Computer and System Sciences, 38(1):86-124, 1989.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 4 January 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "persistent data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 4 January 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/persistentDataStructure.html