Sciweavers

66 search results - page 6 / 14
» Conjunctive Query Containment over Trees
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 10 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
FOIKS
2010
Springer
14 years 2 months ago
Evolving Schemas for Streaming XML
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
Maryam Shoaran, Alex Thomo
ADBIS
2004
Springer
93views Database» more  ADBIS 2004»
14 years 1 months ago
Query Rewriting Using Views in a Typed Mediator Environment
Abstract. Query rewriting method is proposed for the heterogeneous information integration infrastructure formed by the subject mediator environment. Local as View (LAV) approach t...
Leonid A. Kalinichenko, Dmitry O. Martynov, Sergey...
EDBT
2006
ACM
130views Database» more  EDBT 2006»
14 years 7 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart