Please use this identifier to cite or link to this item:
Title: XML Schema Structural Equivalence
Authors: Duta, Angela C.
Barker, Ken
Alhajj, Reda
Keywords: Computer Science
Issue Date: 20-Dec-2004
Abstract: 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.
Appears in Collections:Barker, Ken
Alhajj, Reda

Files in This Item:
File Description SizeFormat 
2004-764-29.pdf257.44 kBAdobe PDFView/Open
2004-764-29.ps848.92 kBPostscriptView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.