556 search results - page 35 / 112 » Evaluation of probabilistic queries in moving objects databa... |
EDBT
2010
ACM
13 years 10 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...
ICDT
2011
ACM
12 years 11 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...