89 search results - page 9 / 18 » Approximate lineage for probabilistic databases |
EDBT
2006
ACM
14 years 7 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...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...