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  that
focuses on the leaf nodes and eliminates intermediate levels in the XML tree.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org