Uniformly-Distributed Random Generation of Join Orders (2007)
César Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten
. In this paper we study the space of operator trees that can be used to answer a join query, with the goal of generating elements form this space at random. We solve the problem for queries with...
Counting, enumerating, and sampling of execution plans in a cost-based query optimizer (2000)
F. Waas, Florian Waas, César Galindo-legaria
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Fast, Randomized Join-Order Selection - Why Use Transformations? (1994)
César Galindo-Legaria, Arjan Pellenkoft, Martin Kersten
We study the effectiveness of probabilistic selection of join-query evaluation plans, without reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from...