Sciweavers

2608 search results - page 79 / 522
» Inferring Answers to Queries
Sort
View
LPNMR
2009
Springer
14 years 5 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 11 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
ICDE
2006
IEEE
141views Database» more  ICDE 2006»
15 years 15 days ago
Clean Answers over Dirty Databases: A Probabilistic Approach
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such...
Ariel Fuxman, Periklis Andritsos, Renée J. ...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 15 days ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
IJCAI
2003
14 years 16 days ago
Efficient Execution of Recursive Integration Plans
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
Snehal Thakkar, Craig A. Knoblock