9 search results - page 1 / 2 » The Complexity of Transformation-Based Join Enumeration |
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...
VLDB
1990
ACM
13 years 9 months ago
1990
ACM
CIKM
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
ICCS
2003
Springer
13 years 10 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
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...