Date of this Version
We study two classes of XML keys introduced in , and investigate their associated (finite) implication problems. In contrast to other proposals of keys for XML, these two classes of keys can be reasoned about efficiently. In particular, we show that their (finite) implication problems are finitely axiomatizable and are decidable in square time and cubic time, respectively.
XML, Keys, Constraints, (Finite) implication, Axiomatization
Date Posted: 25 May 2005