627 search results - page 16 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
107
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
126
click to vote
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
111
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
IJWIS
2008
14 years 9 months ago
2008
: Purpose -- Efficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. This article prese...
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...