105 search results - page 11 / 21 » Probabilistic ranked queries in uncertain databases |
150
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
100
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
VLDB
1990
ACM
15 years 1 months ago
1990
ACM
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
162
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...