Managing Uncertainty of XML Schema Matching

Free registration required

Executive Summary

Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. In particular, numerous instances of "Possible mappings" between the schemas may be derived from the matching result. In this paper, the authors study the problem of managing possible mappings between two heterogeneous XML schemas. The authors observe that for XML schemas, their possible mappings have a high degree of overlap. They hence propose a novel data structure, called the block tree, to capture the commonalities among possible mappings.

  • Format: PDF
  • Size: 954.1 KB