610 search results - page 13 / 122 » Efficient Query Evaluation on Probabilistic Databases |
WAIM
2004
Springer
15 years 3 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 ...
133
click to vote
SIGMOD
2012
ACM
13 years 6 days 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...
156
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
104
click to vote
PVLDB
2008
14 years 9 months ago
2008
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
172
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such...