Reasoning about Keys for XML
Loading...
Files
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract
We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and decidable in PTIME in the size of keys.
Advisor
Date of presentation
2001-09-08
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-16T22:26:30.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Comments
Postprint version. Published in Lecture Notes in Computer Science, Volume 2397, Revised Papers of the 8th International Workshop on Database Programming Languages 2001 (DBPL 2001), pages 133-148. Publisher URL: http://www.springerlink.com/link.asp?id=74fqf7v3ky2d0w3y
Postprint version. Published in Lecture Notes in Computer Science, Volume 2397, Revised Papers of the 8th International Workshop on Database Programming Languages 2001 (DBPL 2001), pages 133-148. Publisher URL: http://www.springerlink.com/link.asp?id=74fqf7v3ky2d0w3y
Postprint version. Published in Lecture Notes in Computer Science, Volume 2397, Revised Papers of the 8th International Workshop on Database Programming Languages 2001 (DBPL 2001), pages 133-148. Publisher URL: http://www.springerlink.com/link.asp?id=74fqf7v3ky2d0w3y