627 search results - page 7 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
149
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
JDCTA
2010
14 years 4 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
DASFAA
2007
IEEE
15 years 3 months ago
2007
IEEE
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
PVLDB
2008
14 years 9 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...