Skip to main content
SpringerLink
Log in

Mind maps merging in collaborative work

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

This paper discusses the problem of mind maps merging in the context of a collaborative Internet-based work. This problem is important, for example, when one of the users loses its Internet connection but keeps changing a mind map locally, just as his/her collaborators do. So, the Internet reconnection makes it necessary for the local and server copies to be merged. The problem is solved by means of the well-known 3DM algorithm of XML merging, which is modified to meet our specific requirements: (1) two modes are needed for conflict resolution (by default and user-defined); (2) changes in subtrees when resolving Update/Delete conflicts need to be maximally retained; (3) the trees are asymmetric, and the server copy is assumed to be of higher priority; (4) the original version requires an edit-script for retaining the history of changes; (5) nodes of merging trees have unique identifiers, i.e., a more simplified identification procedure can be used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Johnson, M.K., Diff, Patch, and Friends, Linux Journal, August, 1996.

  2. Lindholm, T., A 3-Way Merging Algorithm for Synchronizing Ordered Trees-the 3DM Merging and Differencing Tool for XML, Master’s Thesis, 2005, Helsinki University of Technology.

  3. Lindholm, T., A Three-Way Merge for XML Documents, ACM Symp. on Document Engineering, 2004, pp. 1–10.

  4. Oster, G., Skaf-Molli, H., Molli, P., and Naja-Jazzar, H., Supporting Collaborative Writing of XML Documents, ICEIS, 2007, no. 4, pp. 335–341.

  5. La Fontaine, R., Merging XML Files: A New Approach Providing Intelligent Merge of XML Data Sets, Proc. of XML Europe, 2002, Barcelona, Spain, p. 21.

  6. Rönnau, S., Pauli, C., and Borghoff, U.M., Merging Changes in XML Documents Using Reliable Context Fingerprints, ACM Symp. on Document Engineering, 2008, pp. 52–61.

  7. 3DMJavaImplementation. http://www.cs.hut.fi/~ctl/3dm

  8. XML Diff and Merge. http://www.alphaworks.ibm.com/tech/xmldiffmerge

  9. DeltaXML. http://www.deltaxml.com

  10. SO6 Toolset. http://dev.libresource.org

  11. Buzan, T., The Mind Map Book, New-York: Penguin, 1996.

    Google Scholar 

  12. FreeMind, http://freemind.sourceforge.net

  13. Mind Manager, http://vvww.mindjet.com/products/mindmanager-9-win/overview

  14. Mind Maps Tools, http://www.mindjet.com/products/overview

  15. Comapping, http://www.comapping.com

  16. Mindomo, http://www.mindomo.com

  17. Mindmeister, http://www.mindmeister.com

  18. Koznov, D. and Pliskin, M., Computer-Supported Collaborative Learning with Mind-Maps, ISoLA 2008, CCIS, Margaria, T. and Steffen, B., Eds., vol. 17, 2008, Berlin-Heidelberg: Springer, 2008, pp. 478–489.

    Google Scholar 

  19. Koznov, D.V., A Program Engineering Teaching Technique Based on Mind Maps, Syst. Prog., 2008, no. 3, Terekhov, A.N. and Bulychev, D.Yu., Eds., St.Petersburg University, 2008, pp. 121–140.

  20. Hettel, T., Lawley, M., and Raymond, K., Model Synchronisation: Definitions for Round-Trip Engineering, Vallecillo, A., Gray, J., and Pierantonio, A., Eds., ICMT 2008, LNCS 5063, Berlin-Heidelberg: Springer, 2008, pp. 31–45.

    Google Scholar 

  21. Sudarshan, S.C., Anand, R., Garcia-Molina, H., and Widom, J., Change Detection in Hierarchically Structured Information, Proc. of ACM SIGMOD Int. Conf. on Management of Data, ACM, 1996, pp. 493–504.

  22. Sudarshan, S.C. and Garcia-Molina, H., Meaningful Change Detection in Structured Data, Proc. of ACM SIGMOD Int. Conf. on Management of Data, ACM, 1997, pp. 26–37.

  23. Shvaiko, P. and Euzenat, J., A Survey of Schema-Based Matching Approaches, J. Data Semantics IV, 2005, pp. 146–171.

  24. Ukkonen, E., Approximate String Matching with q-gram sand maximal matches, Theoretical Comput. Sci., 1992, vol. 92, no. 1, pp. 191–211.

    Article  MathSciNet  MATH  Google Scholar 

  25. http://useless-factor.blogspot.com/2008/01/matching-diffing-and-merging-xml.html, http://stackoverflow.com/questions/2222548/3-way-xml-merge-algorithm

Download references

Author information

Authors and Affiliations

  1. St.Petersburg State University, Universitetskii pr. 26, Petergof, St. Petersburg, 198504, Russia

    D. Koznov, E. Larchik, M. Pliskin & N. Artamonov

Authors
  1. D. Koznov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Larchik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Pliskin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. Artamonov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Koznov.

Additional information

Original Russian Text © D. Koznov, E. Larchik, M. Pliskin, N. Artamonov, 2011, published in Programmirovanie, 2011, Vol. 37, No. 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koznov, D., Larchik, E., Pliskin, M. et al. Mind maps merging in collaborative work. Program Comput Soft 37, 315–321 (2011). https://doi.org/10.1134/S036176881106003X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S036176881106003X

Keywords

Search

Navigation