186 search results - page 21 / 38 » Queries and materialized views on probabilistic databases |
105
click to vote
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
126
Voted
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
104
click to vote
ADBIS
2009
Springer
14 years 10 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
105
click to vote
ICDE
1998
IEEE
15 years 4 months ago
1998
IEEE
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
106
click to vote
SIGMOD
2001
ACM
16 years 21 days ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...