XML Schema Structural Equivalence
dc.contributor.author | Duta, Angela C. | eng |
dc.contributor.author | Barker, Ken | eng |
dc.contributor.author | Alhajj, Reda | eng |
dc.date.accessioned | 2008-02-26T20:23:39Z | |
dc.date.available | 2008-02-26T20:23:39Z | |
dc.date.computerscience | 2004-12-20 | eng |
dc.date.issued | 2004-12-20 | eng |
dc.description.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. | eng |
dc.description.notes | 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 digitize@ucalgary.ca | eng |
dc.identifier.department | 2004-764-29 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30316 | |
dc.identifier.uri | http://hdl.handle.net/1880/45393 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | XML Schema Structural Equivalence | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1