kirancodes.me
To Proof Maintenance & Beyond!

Structured merge with auto-tuning: balancing precision and performance

Sven Apel, Olaf Leßenich, Christian Lengauer

Abstract

Software-merging techniques face the challenge of finding a balance between precision and performance. In practice, developers use unstructured-merge (i.e., line-based) tools, which are fast but imprecise. In academia, many approaches incorporate information on the structure of the artifacts being merged. While this increases precision in conflict detection and resolution, it can induce severe performance penalties. Striving for a proper balance between precision and performance, we propose a structured-merge approach with auto-tuning. In a nutshell, we tune the merge process on-line by switching between unstructured and structured merge, depending on the presence of conflicts. We implemented a corresponding merge tool for Java, called JDime. Our experiments with 8 real-world Java projects, involving 72 merge scenarios with over 17 million lines of code, demonstrate that our approach indeed hits a sweet spot: While largely maintaining a precision that is superior to the one of unstructured merge, structured merge with auto-tuning is up to 12 times faster than purely structured merge, 5 times on average.

BibTeX
@inproceedings{Apel-al:ASE12,
  author    = {Sven Apel and
               Olaf Le{\ss}enich and
               Christian Lengauer},
  title     = {Structured merge with auto-tuning: balancing precision and performance},
  booktitle = {ASE},
  pages     = {120--129},
  publisher = {{ACM}},
  year      = {2012},
}

Related papers