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.
Cite
CITATION STYLE
Buneman, P., Davidson, S., Fan, W., Hara, C., & Tan, W. C. (2002). Reasoning about keys for XML. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2397, pp. 133–148). Springer Verlag. https://doi.org/10.1007/3-540-46093-4_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
