Checking XML Constraints Using Relational Technology

As XML becomes the prevalent format for data interchange
between B2B applications, efficiently checking the validity of XML documents
with respect to a given schema is going to be critical. While this can be
currently achieved using a standard validating parser, we argue that
this is not always the most efficient way. Since most of the XML data
today resides in relational database systems, it makes sense to rely
on the capabilities of database systems for checking the constraints
imposed by particular schemas. In this paper we examine how the various
types of XML constraints can be expressed as SQL queries. We give an
algorithm that, given a mapping between an XML schema and a relational
schema, automatically translates XML constraints into equivalent
database queries. We also report on our experimental evaluation of
this method's performance.

By: Yuan Wang, George A. Mihaila, and Sriram Padmanabhan

Published in: RC22923 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .