333 search results - page 14 / 67 » Read-Once Functions and Query Evaluation in Probabilistic Da... |
WEBDB
2005
Springer
15 years 5 months ago
2005
Springer
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
115
click to vote
EDBT
2010
ACM
15 years 1 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
80
Voted
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
100
Voted
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
161
click to vote
VLDB
2007
ACM
15 years 12 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...