Commit 14d97b7f authored by Pietro Abate's avatar Pietro Abate
Browse files

[r2005-01-25 14:30:36 by beppe] Empty log message

Original author: beppe
Date: 2005-01-25 14:30:36+00:00
parent dea7108c
......@@ -107,7 +107,7 @@ Superseded by the previous paper
</paper>
</li>
<li>
<paper file="papers/padl05.ps.gz">
<paper file="ftp://ftp.di.ens.fr/users/castagna/padl05.ps.gz">
<title>A Full Pattern-based Paradigm for XML Query Processing</title>
<author>V. Benzaken</author>
<author>G. Castagna</author>
......
......@@ -59,6 +59,59 @@ language for XML manipulation that is based on semantic subtyping.
</abstract>
</paper>
</li>
<li>
<paper file="papers/polyx.ps.gz">
<title>Parametric polymorphism for XML</title>
<author>H. Hosoya</author>
<author>A. Frisch</author>
<author>G. Castagna</author>
<comment>In The <i>32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 2005.
</comment>
<abstract> <p> Although several type systems have been investigated
for XML, parametric polymorphism is rarely treated. This
well-established typing discipline can also be useful in XML
processing in particular for programs involving "parametric schemas,"
i.e., schemas parameterized over other schemas (e.g., SOAP). The
difficulty in treating polymorphism for XML lies in how to extend the
"semantic" approach used in the mainstream (monomorphic) XML type
systems. A naive extension would be "semantic" quantification over all
substitutions for type variables. However, this approach reduces to an
NEXPTIME-complete problem for which no practical algorithm is known,
and, moreover, the type system obtained in this way is characterized
by a hardly useful expressiveness. In this paper, we propose a
lighter-weight way of extending the semantic approach, where we
interpret type variables as markings in data values for indicating the
parameterized subparts. As a result, we can construct a sensible
polymorphic type system both with a semantic flavor and a set of
practical algorithms needed for typechecking. Most of these algorithms
can be obtained by local modifications to existing ones for a
monomorphic system.</p> </abstract>
</paper>
</li>
<li>
<paper file="ftp://ftp.di.ens.fr/users/castagna/padl05.ps.gz">
<title>A Full Pattern-based Paradigm for XML Query Processing</title>
<author>V. Benzaken</author>
<author>G. Castagna</author>
<author>C. Miachon</author>
<comment>
Proceedings of the <i>7th International Symposium on
Practical Aspects of Declarative Languages</i>, LNCS 3350, 2005.
</comment>
<abstract> <p> In this article we investigate a novel execution
paradigm---ML-like pattern-matching---for XML query processing and use it to
extend the CDuce language with query capabilities. We show that such a paradigm
is well adapted for a common and frequent set of queries and advocate that it
constitutes a candidate for efficient execution of XML queries far better than
the current XPath-based query mechanisms. We support our claim by comparing
performances of XPath-based queries with pattern based ones, and by comparing
the latter with the two efficiency-best XQuery processor we are aware of. </p>
</abstract>
</paper>
</li>
<li>
<paper file="http://www-rocq.inria.fr/~manolesc/PAPERS/outlineTutorialSBBD2004.ps">
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment