Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Pavel Panchekha, David Wilson, and Edward Z. Yang, “Blame Trees”, in Proceedings of the 13th Algorithms and Data Structures Symposium (WADS 2013), Lecture Notes in Computer Science, volume 8037, London, Ontario, Canada, August 12–14, 2013, pages 280–290.

BibTeX

@InProceedings{BlameTrees_WADS2013,
  AUTHOR        = {Erik D. Demaine and Pavel Panchekha and David Wilson and Edward Z. Yang},
  TITLE         = {Blame Trees},
  BOOKTITLE     = {Proceedings of the 13th Algorithms and Data Structures Symposium (WADS 2013)},
  bookurl       = {http://www.wads.org/},
  ADDRESS       = {London, Ontario, Canada},
  MONTH         = {August 12--14},
  YEAR          = 2013,
  SERIES        = {Lecture Notes in Computer Science},
  seriesurl     = {http://www.springer.de/comp/lncs/},
  VOLUME        = 8037,
  PAGES         = {280--290},

  length        = {10 pages},
  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1007/978-3-642-40104-6_25},
  dblp          = {https://dblp.org/rec/conf/wads/DemainePWY13},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/978-3-642-40104-6_25">SpringerLink</A>.},
}

Abstract:

We consider the problem of merging individual text documents, motivated by the single-file merge algorithms of document-based version control systems. Abstracting away the merging of conflicting edits to an external conflict resolution function (possibly implemented by a human), we consider the efficient identification of conflicting regions. We show how to implement tree-based document representation to quickly answer a data structure inspired by the “blame”' query of some version control systems. A “blame”' query associates every line of a document with the revision in which it was last edited. Our tree uses this idea to quickly identify conflicting edits. We show how to perform a merge operation in time proportional to the sum of the logarithms of the shared regions of the documents, plus the cost of conflict resolution. Our data structure is functional and therefore confluently persistent, allowing arbitrary version DAGs as in real version-control systems. Our results rely on concurrent traversal of two trees with short circuiting when shared subtrees are encountered.

Comments:

This paper is also available from SpringerLink.

Length:

The paper is 10 pages.

Availability:

The paper is available in PDF (264k).

See information on file formats.

[Google Scholar search]