Some Properties of Complex Tree Integration Criteria

摘要

Hierarchical data integration becomes important with the abundance of XML based solution in today world. We have previously introduced a model of hierarchical data - the Complex Tree, a model for its integration and some criteria to guide the integration process. In this paper some of those criteria are further analyzed and their properties are described: 1) the completeness criterion based integration may be decomposed into subtasks with the same final result, 2) the minimality criterion based integration may also be decomposed, but the result, while correct, is not guaranteed to be the same, 3) the precision and relationship completeness criteria are in some cases mutually exclusive.