XML Schema Structural Equivalence [article]

Angela C. Duta, Ken Barker, Reda Alhajj, University Of Calgary, University Of Calgary
The Xequiv algorithm determines when two XML schemas are equivalent based on their structural organization. It calculates the percentages of schema inclusion in another schema by considering the cardinality of each leaf node and its interconnection to other leaf nodes that are part of a sequence or choice structure. Xequiv is based on the Reduction Algorithm [8] that focuses on the leaf nodes and eliminates intermediate levels in the XML tree.
doi:10.11575/prism/30316 fatcat:d6vdtdxju5etzivka3axdh33q4