Sciweavers

1778 search results - page 170 / 356
» The Theory of Probabilistic Databases
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 6 months 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
PODS
2004
ACM
139views Database» more  PODS 2004»
16 years 6 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
PODS
2010
ACM
207views Database» more  PODS 2010»
15 years 11 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
PODS
2007
ACM
107views Database» more  PODS 2007»
16 years 6 months ago
Polynomial time fragments of XPath with variables
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
16 years 24 days ago
PLUS: Synthesizing privacy, lineage, uncertainty and security
— Privacy, lineage, uncertainty, and security are important to many information integration efforts, and these “PLUS” properties interact in a number of complex ways. This pa...
Barbara T. Blaustein, Len Seligman, Michael Morse,...