619 search results - page 44 / 124 » Query Planning in Infomaster |
113
click to vote
WEBDB
1999
Springer
15 years 6 months ago
1999
Springer
We propose a framework for navigation-driven evaluation of virtual mediated views. The approach is based on lazy mediators that translate incoming client navigations on a virtual ...
135
click to vote
APWEB
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
120
click to vote
SIGMOD
1993
ACM
15 years 6 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
206
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
163
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...