214 search results - page 11 / 43 » Foundations of probabilistic answers to queries |
VLDB
1990
ACM
14 years 16 days 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...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
ISRR
2001
Springer
14 years 28 days ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Recently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over un...