116 search results - page 1 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
VLDB
1990
ACM
13 years 9 months ago
1990
ACM
VLDB
1997
ACM
13 years 9 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
ICDE
2010
IEEE
13 years 10 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
SIGMOD
2000
ACM
13 years 9 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...