Commit 5acd0a05 authored by Pietro Abate's avatar Pietro Abate
Browse files

[r2005-05-25 21:20:19 by beppe] Empty log message

Original author: beppe
Date: 2005-05-25 21:20:19+00:00
parent 42203b0c
......@@ -101,21 +101,58 @@ monomorphic system.</p> </abstract>
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>
<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>
<include-forest file="http://www.grappa.univ-lille3.fr/bibtex/tralalamachine.php"/>
<li>
<paper file="http://www-rocq.inria.fr/gemo/XAM/publications/XAMsXIMEP2005-submitted.pdf">
<title>AXML Access Modules: Towards Physical Data Independence in XML Databases</title>
<author>A. Arion</author>
<author>V. Benzaken</author>
<author>I. Manolescu</author>
<comment>
<i>2nd International Workshop on XQuery Implementation, Experience,
and Perspectives (XIME-P)</i>, 2005
</comment>
<abstract>
<p> We introduce <i>XML Access Modules (XAMs)</i>, a step towards physical data independence in XDBMSs. A XAM describes, in an algebraic-style formalism, the information contained in a persistent XML storage structure, which may be a storage module, an index, or a materialized view. The set of XAMs describing the storage is used by the optimizer to build data access plans. Using XAMs, a change to the storage (adding or removing a storage structure) is communicated to the optimizer simply by updating the XAM set.
One of the most useful XAM features is the ability to model indexes whose ``keys'' and ``values'' may be complex combinations of XML structure and values. We present the algebraic XAM foundations, with a particular focus on its support for indexes.
</p>
</abstract>
</paper>
</li>
<li>
<paper file="http://www-rocq.inria.fr/gemo/XAM/publications/ULoadVLDB2005-submitted.pdf">
<title>A Full Pattern-based Paradigm for XML Query Processing (demonstration)</title>
<author>A. Arion</author>
<author>V. Benzaken</author>
<author>I. Manolescu</author>
<comment>
Proceedings of the <i>31st International Conference on Very Large Data Bases (VLDB)</i>, 2005.
</comment>
<abstract>
<p> We demonstrate ULoad, an XML storage tuning tool, which is a step towards achieving physical data independence for XML. ULoad is meant to help the database administrator (DBA) in choosing the persistent XML storage and indexing modules best suited for a given dataset, and workload, thus achieving our flexibility and extensibility requirements.
Given a document to store, and a query workload, ULoad: allows the DBA to choose, customize, and apply some storage and indexing models, picked among a large set of existing ones; lets the DBA define her own specialized persistent structures; presents to the DBA the query execution plans (QEPs) for the workload queries, on the storage model chosen, and their costs; and may propose a storage adapted to the data and workload, based on a cost-driven search.
At the core of ULoad lies a novel algebraic formalism (with a simple graphical representation), called <i>XML Access Modules (XAMs)</i>, describing the information contained in a persistent XML storage structure. </p>
</abstract>
</paper>
</li>
<li>
<paper file="http://www-rocq.inria.fr/~manolesc/PAPERS/outlineTutorialSBBD2004.ps">
<title>XML Query Processing: Storage and Query Model Interplay</title>
......
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