Sciweavers

610 search results - page 1 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
VLDB
2004
ACM
77views Database» more  VLDB 2004»
13 years 10 months ago
Efficient Query Evaluation on Probabilistic Databases
Nilesh N. Dalvi, Dan Suciu
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 2 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 6 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
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 5 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 6 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande