M.F. Fernandez, J. Simeon, and P. Wadler. A Semimonad for Semi-structured Data. In Proc. of the 8th Int'l Conference on Database Theory (ICDT), pages 263--300, London, UK, January 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... by using one of the transformations from the normalization algorithm, then (D, lossless (D , Thus, if (D , is the output of the normalization algorithm on (D, then (D, lossless (D , More over, the transformations on the documents can be implemented in XML query languages [13, 32]. Reasoning about FDs In the previous section we saw that it is possible to losslessly convert a DTD into one in XNF. The algorithm used FD implication. We now show that for most classes of DTDs used in practice, this problem is tractable. We assume, without loss of generality, that all FDs have ....

M. Fernandez, J. Simdon, P. Wadler. A semi-monad for semi-structured data. ICDT'01, pages 263-300.

.... grep primitive that arises naturally from types [15] The XDuce implementation demonstrates ecient algorithms for subtyping and typechecking [18] XDuce has had a signi cant impact in parts of the XML world; in particular, its in uence can be seen in the type system of the XML Query Algebra [11], the core of the W3C standard query language for XML, as well as newer schema languages such as TREX [8] and Relax NG [9] However, signi cant work remains before the bene ts of regular expression types can be made available to the vast majority of XML programmers. In particular, the simple ....

M. F. Fernandez, J. Simeon, and P. Wadler. A semi-monad for semi-structured data. In J. V. den Bussche and V. Vianu, editors, Proceedings of 8th International Conference on Database Theory (ICDT 2001.

....formal semantics document [11] are related to optimizing title exhaustively searches whole data only to retrieve relatively small fragments consisting of title elements. In this paper, we provide a solution to the above issues. We have been motivated by the XQuery core s support for projection [10, 11, 13]. The XQuery core translates a projection into nested iterations sensitive to their local types. In this way, the projection is naturally typed and significantly optimized. To achieve similar results, we adapt a well known technique called function inlining [1] to typing and optimizing ....

....4. The experiments we conducted and the experimental results are presented in Section 5. Finally, Section 6 concludes the paper. 1.3 Related Work There has been a little work on typing XML queries and optimizing recursive functions. Some excellent work on typing XML queries such as semi monad [13] and XDuce [15] has a#ected the type system of the XQuery core significantly. However, the XQuery core cannot properly type recursive XML queries [2, 10, 11] In this regard, our structural function inlining is a novel technique for typing recursive XML queries. As to optimizing functions, most ....

[Article contains additional citation context not shown here]

M. Fernandez, J. Simeon, and P. Wadler. A semimonad for semi-structured data. In Proceedings of the 8th International Conference on Database Theory, pages 263--300, January 2001.

....K occurs exactly once in w, where L(ff) is the regular language defined by ff; 2) the type of K is S, i.e. P (K) S and therefore, in a data tree, a K element is represented as a text node. One can easily verify these syntactic restrictions, for instance using the type checking algorithm of [28]. For any element x, we refer to its K element as x:K and the value of x:K as val(x:K) This key constraint asserts that for any elements x and y, if they agree on the values of their K sub elements, i.e. val(x:K) val(y:K) then x and y must be the same node, i.e. x = y. Observe that we ....

M. F. Fernandez, J. Sim eon, and P. Wadler. A semi-monad for semi-structured data. In Proceedings of International Conference on Database Theory (ICDT), London, UK, Jan. 2001.

No context found.

M. Fernandez, J. Simeon, and P. Wadler. A semi-monad for semi-structured data. In Proc. of Intl. Conf. on Database Theory, London, UK, Jan. 2001.

....L# #, K occurs exactly once in w,whereL# # is the regular language defined by ; 2) the type of K is S # , i.e. P #K##S # and therefore, in a data tree, a K element is represented as a text node. One can easily check these syntactic restrictions, for instance using the type checking algorithm of [25]. For any element x, we refer to its K element as x:K and the value of x:K as val#x:K#. This key constraint asserts that for any elements x and y, if they agree on the values of their K sub elements, i.e. val#x:K##val#y:K#, then x and y must be the same node, i.e. x # y. Observe that we ....

M. F. Fernandez, J. Sim eon, and P. Wadler. A semi-monad for semi-structured data. In Proceedings of International Conference on Database Theory (ICDT), pages 263--300, London, UK, Jan. 2001.

....how their constraints interact with subtyping. UCM constraints 1 are easy to manipulate in practice: we illustrate their use with a number of examples and give simple algorithms for their implementation. In particular, we make the following technical contributions: We extend the type system of [12], along with the subtyping mechanism of [14] by a notion of keys and foreign keys. This constitutes UCM, a schema language for XML with integrity constraints. We show that UCM schemas can capture relational constraints, object oriented models (with object identity and scoped references) and ....

....calls, each of these mechanisms having been introduced to simulate some of the constraints found in traditional models. As a result of this, even reasoning about consistency for these constraints is very hard. 3 UCM by examples 3. 1 XML algebra support The UCM model relies on the XML algebra of [12] for the structural part of the schema language and for the semantics of integrity constraints. This algebra uses a type system that is similar to other proposals [2, 8, 13] and captures the structural aspects of XML schema [16] In this section, we review the features of the algebra that we use, ....

[Article contains additional citation context not shown here]

M. F. Fernandez, J. Simeon, and P. Wadler. A semi-monad for semi-structured data. In Proceedings of International Conference on Database Theory (ICDT), London, UK, Jan. 2001. http://www-db.research.bell-labs.com/users/simeon/xa-icdt.pdf.

....and how their constraints interact with subtyping. UCM constraints 1 are easy to manipulate in practice: we illustrate their use with a number of examples and show that they can be implemented eciently. In particular, we make the following technical contributions: We extend the type system of [12], along with the subtyping mechanism of [14] by a notion of keys and foreign keys. This constitutes UCM, a schema language for XML with integrity constraints. We show that UCM schemas can capture relational constraints, object oriented models (object identity and references) and the ID IDREF ....

....calls, each of these mechanisms having been introduced to simulate some of the constraints found in traditional models. As a result of this, even reasoning about consistency for these constraints is very hard. 3 UCM by examples 3. 1 XML algebra support The UCM model relies on the XML algebra of [12] for the structural part of the schema language and for the semantics of integrity constraints. This algebra uses a type system that is similar to other proposals [2, 8, 13] and captures the structural aspects of XML schema [16] In this section, we review the features of the algebra that we use, ....

[Article contains additional citation context not shown here]

M. F. Fernandez, J. Simeon, and P. Wadler. A semi-monad for semi-structured data. In Proceedings of International Conference on Database Theory (ICDT), London, UK, Jan. 2001. http://www-db.research.bell-labs.com/users/simeon/xa-icdt.pdf.

No context found.

M.F. Fernandez, J. Simeon, and P. Wadler. A Semimonad for Semi-structured Data. In Proc. of the 8th Int'l Conference on Database Theory (ICDT), pages 263--300, London, UK, January 2001.

No context found.

M. Fernandez, J. Simeon, and P. Wadler. "A Semimonad for Semi-structured Data". In Proc. ICDT'01, pages 263--300, 2001.

No context found.

M. Fernandez, J. Simeon, and P. Wadler. A Semi-monad for Semi-structured Data. In Proc. of the 8th Int'l Conference on Database Theory (ICDT), London, UK, Jan. 2001.

No context found.

M.F. Fernandez, J. Simeon, and P. Wadler. A Semimonad for Semi-structured Data. In Proc. of the 8th Int'l Conference on Database Theory (ICDT), pages 263--300, London, UK, January 2001.

No context found.

M. Fernandez, J. Simeon, and P. Wadler. "A Semimonad for Semi-structured Data". In Proc. ICDT'01, pages 263--300, 2001.

No context found.

Fernandez, M., Simeon, J., Wadler, P., "A Semi-monad for Semi-structured Data" Proceedings of the International Conference on Database Theory, London, UK 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