Reasoning about Keys for XML

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 19104-6389, USA; Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974-0636, USA; 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 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.

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies the functional dependency and normalization propagation between relations and XML. First the paper gives the definition of functional dependencies and keys for XML; based on it, the concepts of redundancy and DTD normalization are defined. The paper then discusses the functional dependency propagation between relations and XML. When using a general mapping from relational schema to DTD, the paper shows that all the relational functional dependencies can be preserved in the DTD and when applying a commonly used method to mapping DTD to relational schema, each functional dependency on relations has a corresponding one in the original DTD. The significance of functional dependency propagation lies in the normalization propagation. The paper proves that using the methods above, if the original relation is in BCNF, the generated DTD is normalized, and if the original DTD is normalized, the generated relations are in BCNF.
    Journal of Software 01/2005; 16(4).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Many techniques have been proposed to store and query XML data efficiently. One way achieving this goal is using relational database by transforming XML data into relational format. It is important to transform schema to preserve the content, the structure and the constraints of the semantics information of the XML document. Especially, key constraints are an important part of database theory. Therefore, the proposal technique has considered the semantics of XML as expressed by primary keys and foreign keys. And, the proposal technique can preserve not only XML data constraints but also the content and the structure and the semantics of XML data thru transformation process. Transforming information is the content and the structure of the document(the parent-child relationship), the functional dependencies, semantics of the document as captured by XML key and keyref constraints. Because of XML schema transformation ensures that preserving semantic constraints, the advantages of these transformation techniques do not need to use the stored procedure or trigger which these data ensures data integrity in the relational database. In this paper, there is not chosen the ID/IDREF key which supported in DTD, the inheritance relationship, the implicit referential integrity.
    Journal of the Korea Society of Computer and Information. 01/2011; 16(3).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A concept of functional dependency in XML documents based on constraint-tree is proposed. The definition proposed in our paper overcomes the shortcomings of previous definitions in the following aspects: (1) it captures the tree-structured characteristics of XML documents in structure. (2) it considers a more general situation of XML functional dependencies based on sub-trees with some constraint conditions in XML documents. The relationship between our definition of XML functional dependencies and other related definitions is also discussed in the paper.
    Proceedings of the IEEE International Conference on e-Business Engineering; 10/2006

Full-text (4 Sources)

Available from
May 28, 2014