Chapter

Reasoning about keys for XML

Department of Computer Science, University of California, Santa Cruz, 1156 High Street, Santa Cruz, CA 95064, USA
DOI: 10.1007/3-540-46093-4_8
Source: DBLP

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.

0 Followers
 · 
175 Views

Full-text (4 Sources)

Download
42 Downloads
Available from
May 28, 2014