abstract ;;Quote: Harmony synchronizes tree-structured data formats using their schema; handles conflicts

3 ;;Quote: synchronize disparate schemas using bi-directional, tree transforms (lenses) from input trees to synchronization schemas; controls alignment of information and identifies conflicts

4 ;;Quote: for processing, encode XML as unordered, edge-labeled trees; each pair of braces denotes a tree node and each id->val a labeled child

6 ;;Quote: a state-based synchronizer depends only on the common ancestor state and current state; for loosely coupled, XML data

7 ;;Quote: either allow synchronization to back out a user's changes or propagate just the non-conflicting changes; the later is better for unsupervised reconciliations

8 ;;Quote: local alignment by name is easier to understand, while global alignment works better for ordered data

9 ;;Quote: a syncronizer should be safe, maximal, and schema preserving; do not back out changes; do not make up content; do not propagate conflicts

11 ;;Quote: path consistency -- the valid trees for a node only depend on the path to the node; allows a subtree to move to the same location in another tree