Reasoning About Keys for XML
Loading...
Files
Penn collection
Technical Reports (CIS)
Degree type
Discipline
Subject
XML
Keys
Constraints
(Finite) implication
Axiomatization
Keys
Constraints
(Finite) implication
Axiomatization
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
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.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2000-01-01
Volume number
Issue number
Publisher
Publisher DOI
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-00-26.
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-00-26.
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-00-26.