Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a specific type of content under specific constraints. By exploiting type-specific constraints, adequate deltas can be computed even without detailed operation logs. The framework thereby allows the use of unmodified third-party editing applications. We present initial experience with conflict detection and content merging algorithms for a number of link collection types, namely sets, lists, maps, and maps without duplicates. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Wienberg, A. (2003). Merging collection data structures in a content management system. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2649, 134–147. https://doi.org/10.1007/3-540-39195-9_10
Mendeley helps you to discover research relevant for your work.