Name
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 (Duta et al., 2006) that focuses on the leaf nodes and eliminates intermediate levels in the XML tree. |
Year | Venue | Keywords |
|---|---|---|
2007 | ICEIS 2007: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS: INFORMATION SYSTEMS ANALYSIS AND SPECIFICATION | schema equivalence,XML structures |
Field | DocType | Citations |
Data mining,Computer science,XML validation,Tree (data structure),Document Structure Description,Cardinality,XML schema,XML tree,Schema (psychology),XML Schema Editor | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Angela Cristina Duta | 1 | 11 | 1.72 |
| Ken Barker | 2 | 834 | 83.23 |
| Reda Alhajj | 3 | 1919 | 205.67 |