Departmental Papers (CIS)

Date of this Version

November 2002

Document Type

Conference Paper

Comments

Copyright ACM, 2002. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 11th International Conference on Information and Knowledge Management 2002, pages 446-452.
Publisher URL: http://doi.acm.org/10.1145/584792.584866

Abstract

The role of XML in data exchange is evolving from one of merely conveying the structure of data to one that also conveys its semantics. In particular, several proposals for key and foreign key constraints have recently appeared, and aspects of these proposals have been adopted within XMLSchema. In this paper, we examine the problem of checking keys and foreign keys in XML documents using a validator based on SAX. The algorithm relies on an indexing technique based on the paths found in key definitions, and can be used for checking the correctness of an entire document (bulk checking) as well as for checking updates as they are made to the document (incremental checking). The asymptotic performance of the algorithm is linear in the size of the document or update. Furthermore, experimental results demonstrate reasonable performance.

Keywords

XML, constraints, key validation, finite state machine

Share

COinS
 

Date Posted: 08 May 2005