Sciweavers

214 search results - page 4 / 43
» Foundations of probabilistic answers to queries
Sort
View
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 2 months ago
Faster Query Answering in Probabilistic Databases using Read-Once Functions
Sudeepa Roy, Vittorio Perduca, Val Tannen
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 8 months 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
ICDE
2006
IEEE
141views Database» more  ICDE 2006»
14 years 8 months 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. ...
ICDT
2001
ACM
153views Database» more  ICDT 2001»
13 years 11 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
14 years 25 days ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...