Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

ICEIS
2007
IEEE

favoriteEmaildiscussreport

110views Information Technology» more ICEIS 2007»

XML schema structural equivalence

14 years 5 months ago

XML schema structural equivalence

Download pages.cpsc.ucalgary.ca

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.

Angela Cristina Duta, Ken Barker, Reda Alhajj

Real-time Traffic

ICEIS 2007 | Information Systems | Leaf Nodes | Schema Inclusion | Xequiv Algorithm Determines |

claim paper

Related Content

» RA An XML Schema Reduction Algorithm

» Resolving Structural Conflicts in the Integration of XML Schemas A Semantic Approach

» Similarity of XML schema definitions

» Expressiveness of XSDs from practice to theory there and back again

» Semantic Schema Matching

» Indexing XML Objects with Ordered Schema Trees

» On Inference of XML Schema with the Knowledge of an Obsolete One

» XMLbased XML schema access

» A Semantic Approach to Integrating XML and Structured Data Sources

Post Info
More Details (n/a)

Added	03 Jun 2010
Updated	03 Jun 2010
Type	Conference
Year	2007
Where	ICEIS
Authors	Angela Cristina Duta, Ken Barker, Reda Alhajj

Comments (0)