Cost Distributions of Search Spaces in Query Optimization (2007)
J. Pellenkoft, M. L. Kersten, Arjan Pellenkoft, Martin Kersten
Query optimization algorithms explore a large space of query execution plans looking for an optimal solution. The predominant algorithms move around the search space in either a deterministic or...
Uniformly-Distributed Random Generation of Join Orders (2007)
J. Pellenkoft, M. L. Kersten, 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...
A Multi-Query Optimizer for Monet (2000)
S. Manegold, J. Pellenkoft, M. L. Kersten, Stefan Manegold, Arjan Pellenkoft, Martin Kersten
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Probabilistic bottom-up join order selection — breaking the curse of NP-completeness (1999)
F. Waas, J. Pellenkoft, Florian Waas, Arjan Pellenkoft
for promotion of mathematics and computer science and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Curse of NP-completeness ABSTRACT (1999)
F. Waas, J. Pellenkoft, Florian Waas, Arjan Pellenkoft
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Exploiting Cost Distributions for Query Optimization (1998)
F. Waas, J. Pellenkoft, Florian Waas, Arjan Pellenkoft
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Complexity of Transformation-Based Optimizers and Duplicate-Free Generation of Alternatives (1996)
J. Pellenkoft, M. L. Kersten, Issn -x, Arjan Pellenkoft, ...
Transformation-based optimizers that explore a search space exhaustively usually apply all possible transformation rules on each alternative, and stop when no new information is produced. In general,...
Fast, randomized joinorder selection---why use transformations (1994)
C. Galindo-legaria, J. Pellenkoft, M. L. Kersten, 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 the...