Reasoning About Keys for XML
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.
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
<br>University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-00-26. <br><p>