Sciweavers

20 search results - page 3 / 4
» Probabilistic Verifiers: Evaluating Constrained Nearest-Neig...
Sort
View
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 5 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
PVLDB
2010
97views more  PVLDB 2010»
13 years 3 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 8 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 7 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 3 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu