Reasoning about keys for XML

  • Authors:
  • Peter Buneman;Susan Davidson;Wenfei Fan;Carmem Hara;Wang-Chiew Tan

  • Affiliations:
  • School of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK;Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut Street, Philadelphia, PA;Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ;Departamento de Informatica, Universidade Federal do Parana, Centro Politecnico, Curitiba, PR 81531-990, Brazil;Department of Computer Science, University of California, Santa Cruz, 1156 High Street, Santa Cruz, CA

  • Venue:
  • Information Systems
  • Year:
  • 2003

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, 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.