735 search results - page 14 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
209
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
WAIM
2004
Springer
15 years 5 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
110
click to vote
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
103
click to vote
WWW
2010
ACM
15 years 5 months ago
2010
ACM
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....