Sciweavers

333 search results - page 1 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 3 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 6 days ago
Faster Query Answering in Probabilistic Databases using Read-Once Functions
Sudeepa Roy, Vittorio Perduca, Val Tannen
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 8 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 7 days ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...