What's Hard about XML Schema Constraints?

  • Authors:

  • Marcelo Arenas;Wenfei Fan;Leonid Libkin

  • Affiliations:

  • -;-;-

  • Venue:
  • DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.04

Visualization

Abstract

Data description for XML usually comes in the form of a type specification (e.g., a DTD) together with integrity constraints. XML Schema allows one to mix DTD features with semantic information, such as keys and foreign keys. It was shown recently [2,7] that the interaction of DTDs with constraints may be rather nontrivial. In particular, testing if a general specification is consistent is undecidable, but for the most common case of single-attribute constraints it is NP-complete, and linear time if no foreign keys are present.However, XML Schema design did not adopt the form of constraints prevalent in the database literature, and slightly changed the semantics of keys, foreign keys, and unique constraints. In this paper we demonstrate the very costly effect of this slight change on the feasibility of consistency checking. In particular, all the known hardness results extend to the XML Schema case, but tractability results do not. We show that even without foreign keys, and with very simple DTD features, checking consistency of XML-Schema specifications is intractable.