Versioning Tree Structures by Path-Merging

DOI10.1007/978-3-540-69311-6_13MaRDI QIDQ3507324zbMATH OpenOpenAlexFDO

Authors Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann

Publication date 19 June 2008

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69311-6_13

zbMATH Keywords

node-copyingPartial persistencepath-copyingpath-merging

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Making data structures persistent
• Data structures for mergeable trees
• Confluently persistent tries for efficient version control
• Confluently Persistent Tries for Efficient Version Control
• Fully persistent B-trees

Cites work

• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Searching and storing similar lists

Cited in

(2)

• New Data Structures for IP Lookup and Conflict Detection
• Blame trees

This page was built for publication: Versioning Tree Structures by Path-Merging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507324)