322 search results - page 7 / 65 » Least Expected Cost Query Optimization: What Can We Expect |
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
CIA
1998
Springer
14 years 24 days ago
1998
Springer
In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of ...
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
CIDR
2009
13 years 9 months ago
2009
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
VLDB
1998
ACM
14 years 23 days ago
1998
ACM
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...