Reasoning about Keys for XML

  • Authors:
  • Peter Buneman;Susan B. Davidson;Wenfei Fan;Carmem S. Hara;Wang Chiew Tan

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.