P. Buneman, W. Fan, J. Simeon, and S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record 30, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....###### ### # #### ### # #### ####### It should be mentioned that the distinction between (traditional) structural constraints (types) and (traditional) integrity constraints is not always well16 de ned. It is dictated largely by what conventional programming languages treat as types. See [7] for detailed discussion on this topic. The concept of relativekeys can be naturally adapted for strong keys as well. We say a document satis es a strong relativekey speci cation (Q; Q ;S) i for all nodes n in [ Q] n satis es the strong key (Q ;S) The strong notion and weak notion ....

P. Buneman, W. Fan, J. Simeon, and S. Weinstein. Constraints for Semistructured Data and XML. In ###### ###### #####, March 2001.

....is np complete in the unary case) whereas it is trivial in classical databases. The impact of DTDs and other schema formalisms on constraints is interesting both theoretically and practically, and remains largely unexplored. A survey of constraints in semi structured data and XML is presented in [26]. Constraints in semi structured data are also discussed in [2] 3. QUERIES ON THE WEB Much of classical database theory revolves around the theory of query languages. In the relational framework, this is solid, familiar ground. Queries are defined as computable, generic mappings from relational ....

P. Buneman, W. Fan, J. Simeon, and S. Weinstein. Constraints for semi-structured data and XML. SIGMOD Record, 30(1), 2001.

....of expressing keys. Generalizations of functional dependencies have also been studied [23, 26, 33] However these generalizations were investigated in database settings, which are quite different from the tree model for XML data considered in this paper. Surveys on XML constraints can be found in [13, 34]. The remainder of the paper is organized as follows. Section 2 formally defines XML trees, value equality, and (absolute and relative) keys for XML. Section 3 establishes the finite axiomatizability and complexity results: First, we give a quadratic time algorithm for determining inclusion of ....

P. Buneman, W. Fan, J. Sim'eon, and S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record, 30(1), 2001.

....of expressing keys. Generalizations of functional dependencies have also been studied [24, 27, 34] However these generalizations were investigated in database settings, which are quite di erent from the tree model for XML data considered in this paper. Surveys on XML constraints can be found in [14, 35]. The remainder of the paper is organized as follows. Section 2 formally de nes XML trees, value equality, and (absolute and relative) keys for XML. Section 3 establishes the nite axiomatizability and complexity results: First, we give a quadratic time algorithm for determining inclusion of path ....

P. Buneman, W. Fan, J. Simeon, and S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record, 30(1), 2001.

.... ROOT A 1 A A 2 A ROOT It should be mentioned that the distinction between (traditional) structural constraints (types) and (traditional) integrity constraints is not always well defined. It is dictated largely bywhatconventional programming languages treat as types. See [9] for detailed discussion on this topic. The concept of relativekeys can be naturally adapted for strong keys as well. Wesay a document satisfies a strong relative key specification (Q# (Q 0 #S) iff for all nodes n in [ Q] n satisfies the strong key (Q 0 #S) The strong notion and weak ....

Peter Buneman, Wenfei Fan, Jerome Simeon and Scott Weinstein. Constraints for Semistructured Data and XML. SIGMOD Record 30(1), March 2001.

No context found.

P. Buneman, W. Fan, J. Simeon, and S. Weinstein. Constraints for semistructured data and XML. SIGMOD Record 30, 2001.

No context found.

P. Buneman, W. Fan, J. Simeon and S. Weinstein, "Constraints for Semistructured Data and XML", SIGMOD Record, March 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC