Sciweavers

Share
VLDB
1997
ACM

The Complexity of Transformation-Based Join Enumeration

11 years 5 months ago
The Complexity of Transformation-Based Join Enumeration
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 produced. A memoizing structure was proposed in [McK93] to improve the re-use of common subexpression, thus improving the efficiency of the search considerably. However, a question that remained open is, what is the complexity of the transformation-based enumeration process? In particular, with n the number of relations, does it achieve the O(3n) lower bound established by [OL90]? In this paper we examine the problem of duplicates, in transformation-based enumeration. In general, different sequences of transformation rules may end up deriving the same element, and the optimizer must detect and discard these duplicate elements generated by multiple paths. We show that the usual commutativity/associativity rules for joins generate O(4n) duplicate operaPermission to copy without fee all or part of this material is g...
Arjan Pellenkoft, César A. Galindo-Legaria,
Added 08 Aug 2010
Updated 08 Aug 2010
Type Conference
Year 1997
Where VLDB
Authors Arjan Pellenkoft, César A. Galindo-Legaria, Martin L. Kersten
Comments (0)
books