XML schema computations: schema compatibility testing and subschema extraction

Authors:
Thomas Yau-tat Lee;David Wai-lok Cheung
Affiliations:
The University of Hong Kong, Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong, Hong Kong
Venue:
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Year:
2010

Citing 4
Cited 0

DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTDs versus XML schema: a practical study

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Simple off the shelf abstractions for XML schema

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose new models and algorithms to perform practical computations on W3C XML Schemas, which are schema minimization, schema equivalence testing, subschema testing and subschema extraction. We have conducted experiments on an e-commerce standard XSD called xCBL to demonstrate the effectiveness of our algorithms. One experiment has refuted the claim that the xCBL 3.5 XSD is compatible with the xCBL 3.0 XSD. Another experiment has shown that the xCBL XSDs can be effectively trimmed into small subschemas for specific applications, which has significantly reduced schema processing time.