Approximate Joins for Data-Centric XML

@article{Augsten2008ApproximateJF,
  title={Approximate Joins for Data-Centric XML},
  author={Nikolaus Augsten and Michael H. B{\"o}hlen and Curtis E. Dyreson and Johann Gamper},
  journal={2008 IEEE 24th International Conference on Data Engineering},
  year={2008},
  pages={814-823}
}
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an approximate join must be used. For XML data, most approximate join strategies are based on some ordered tree matching technique. But in data-centric XML the order is irrelevant: two elements should match even if their subelement order varies. In this paper we give a solution for the approximate join of unordered trees… CONTINUE READING