610 search results - page 99 / 122 » Efficient Query Evaluation on Probabilistic Databases |
VLDB
1989
ACM
15 years 1 months ago
1989
ACM
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
CIKM
2001
Springer
15 years 2 months ago
2001
Springer
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
187
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...