confluently persistent data structure


Definition: A fully persistent data structure that allows meld or merge operations to combine two different versions.

See also partially persistent data structure, fully persistent data structure.

Author: PEB

More information

James R. Driscoll, Daniel D. Sleator, and Robert E. Tarjan, Fully Persistent Lists with Catenation, Journal of the ACM, 41(5):943-949, 1994.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "confluently persistent data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: