Sciweavers

84 search results - page 11 / 17
» Decidable Containment of Recursive Queries
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 2 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
VLDB
2007
ACM
118views Database» more  VLDB 2007»
15 years 12 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
170
Voted
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 5 days ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
100
Voted
PODS
2006
ACM
98views Database» more  PODS 2006»
15 years 11 months ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
ICDT
2010
ACM
259views Database» more  ICDT 2010»
15 years 9 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira