7 search results - page 1 / 2 » The dichotomy of conjunctive queries on probabilistic struct... |
PODS
2007
ACM
15 years 10 months ago
2007
ACM
99
Voted
ICDE
2009
IEEE
15 years 5 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
107
click to vote
EDBT
2006
ACM
15 years 10 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...
75
Voted
PVLDB
2010
14 years 8 months ago
2010
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
97
Voted
IPL
2006
14 years 10 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...