Have you implemented OpenMRS? Please participate in the Implementation Site Survey. If you already have, thank you!
This page is based on 'Conflict detection and resolution - research'.
Conflict detection is based on hash codes. Every object has its own Sync hash code which can be generated basing on that object. During pull or push operation a child instance compares hash codes of a local object, parent's object and recently saved parent's object. The hash code of recently saved parent's object is persisted in the database. We have to establish some shortcuts before we explain when the conflict is detected:
The conflict is detected when ( #lastP != #P) NULL && (#C (#lastP != #P) || (#lastP != #C)).
Note! We have added a new row in a database sync_parent_object_hashcode table for each object pulled from its Parent instance. We keep only the most current hash code of each object.
If the same object causes another conflict, then an old one will be replaced with the new one. So there is only one, the most recent, conflict regarding any object.
The used MergeBehaviour is determined by global property "sync2.mergeBehavior". For instance when it's set to "sync2.newIsTheBestMergeBehaviour" then the NewIsTheBestMergeBehaviour will be used.
With Sync 2 version 1.4.0 was provided two example MergeBehaviour:
1) RestrictConflictMergeBehaviourImpl (link)
This is the default strategy which using hash codes check if the both objects were changed then create unresolved conflict in order to be solved by the users. If only one object changed then it will be choose as a newest version.
2) NewIsTheBestMergeBehaviourImpl (link)
In this strategy used the date of changed to determine the newest version. If the object hasn't the date of change then the strategy will chose the source object.