Confluently persistent tries for efficient version control

DOI10.1007/S00453-008-9274-ZzbMATH Open1201.68042OpenAlexW4249751016MaRDI QIDQ970608FDOQ970608

Stefan Langerman, Eric Price, Erik D. Demaine

Publication date: 19 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9274-z

Recommendations

• Confluently Persistent Tries for Efficient Version Control
• Making data structures confluently persistent. (Extended abstract)
• Making data structures confluently persistent
• Confluent persistence revisited
• scientific article

zbMATH Keywords

fully persistent hash tablehierarchical directory structure

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Subversion
• Introduction to algorithms
• A data structure for dynamic trees
• Making data structures persistent
• Biased Search Trees
• Purely Functional Data Structures
• Title not available (Why is that?)
• Alternatives to splay trees with \(O(\log n)\) worst-case access times
• Title not available (Why is that?)
• Making data structures confluently persistent
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic Models for File Sizes and Double Pareto Distributions

Cited In (7)

• Making data structures confluently persistent. (Extended abstract)
• Title not available (Why is that?)
• Versioning Tree Structures by Path-Merging
• Confluently Persistent Tries for Efficient Version Control
• Multi-Finger Binary Search Trees
• Title not available (Why is that?)
• Making data structures confluently persistent

Uses Software

• LISP
• Subversion

This page was built for publication: Confluently persistent tries for efficient version control

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