Reasoning about Keys for XML

Peter Buneman, Susan Davidson, Wenfei Fan, Carmem Hara, Wang-Chiew Tan

Research output: Contribution to journalArticlepeer-review

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, we show that these keys are always (finitely) satisfiable, and their (finite) implication problem is finitely axiomatizable. Furthermore, we provide a polynomial time algorithm for determining (finite) implication in the size of keys. Our results also demonstrate, among other things, that the analysis of XML keys is far more intricate than its relational counterpart.
Original languageEnglish
Pages (from-to)1037-1063
Number of pages27
JournalInformation Systems
Volume28
Issue number8
DOIs
Publication statusPublished - 2003

Fingerprint

Dive into the research topics of 'Reasoning about Keys for XML'. Together they form a unique fingerprint.

Cite this