XML SCHEMA STRUCTURAL EQUIVALENCE

Angela C. Duta, Ken Barker, Reda Alhajj

2007

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.

Paper Citation

in Harvard Style

C. Duta A., Barker K. and Alhajj R. (2007). XML SCHEMA STRUCTURAL EQUIVALENCE . In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-972-8865-88-7, pages 52-59. DOI: 10.5220/0002357700520059

in Bibtex Style

@conference{iceis07,
author={Angela C. Duta and Ken Barker and Reda Alhajj},
title={XML SCHEMA STRUCTURAL EQUIVALENCE},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2007},
pages={52-59},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002357700520059},
isbn={978-972-8865-88-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - XML SCHEMA STRUCTURAL EQUIVALENCE
SN - 978-972-8865-88-7
AU - C. Duta A.
AU - Barker K.
AU - Alhajj R.
PY - 2007
SP - 52
EP - 59
DO - 10.5220/0002357700520059