Reasoning about Keys for XML [chapter]

Peter Buneman, Susan Davidson, Wenfei Fan, Carmem Hara, Wang-Chiew Tan
2002 Lecture Notes in Computer Science  
We study two classes of XML keys introduced in 6 , and investigate their associated nite implication problems. In contrast to other proposals of keys for XML, these two classes of keys can be reasoned about e ciently. In particular, we show that their nite implication problems are nitely axiomatizable and are decidable in square time and cubic time, respectively.
doi:10.1007/3-540-46093-4_8 fatcat:h66scogdfreglj75nkgaq3kua4