Technical Reports (CIS)
Document Type
Technical Report
Date of this Version
January 2000
Abstract
We study two classes of XML keys introduced in [6], 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.
Keywords
XML, Keys, Constraints, (Finite) implication, Axiomatization
DownloadDate Posted: 25 May 2005
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-00-26.