A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Reasoning about Keys for XML
[chapter]
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