493 search results - page 30 / 99 » Consensus answers for queries over probabilistic databases |
EDBT
2008
ACM
15 years 11 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...
108
click to vote
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
110
click to vote
EDBT
2006
ACM
15 years 11 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...
99
Voted
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
177
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...