Confluently persistent tries for efficient version control

DOI10.1007/s00453-008-9274-zzbMath1201.68042OpenAlexW4249751016MaRDI QIDQ970608

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

zbMATH Keywords

fully persistent hash tablehierarchical directory structure

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Multi-Finger Binary Search Trees ⋮ Unnamed Item

Uses Software

• LISP
• Subversion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subversion
• Making data structures persistent
• A data structure for dynamic trees
• Biased Search Trees
• Making data structures confluently persistent
• Dynamic Models for File Sizes and Double Pareto Distributions
• Purely Functional Data Structures

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