Arjan Pellenkoft

According to our database, Arjan Pellenkoft authored at least 6 papers between 1994 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

Join Order Selection - Good Enough Is Easy.

Florian Waas, Arjan Pellenkoft

Proceedings of the Advances in Databases, 17th British National Conferenc on Databases, 2000

A Multi-query Optimizer for Monet.

Stefan Manegold, Arjan Pellenkoft, Martin L. Kersten

Proceedings of the Advances in Databases, 17th British National Conferenc on Databases, 2000

1997

The Complexity of Transformation-Based Join Enumeration.

Arjan Pellenkoft, César A. Galindo-Legaria, Martin L. Kersten

Proceedings of the VLDB'97, 1997

Duplicate-Free Generation of Alternatives in Transformation-Based Optimizers.

Arjan Pellenkoft, César A. Galindo-Legaria, Martin L. Kersten

Proceedings of the Database Systems for Advanced Applications '97, 1997

1995

Uniformly-Distributed Random Generation of Join Orders.

César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten

Proceedings of the Database Theory, 1995

1994

Fast, Randomized Join-Order Selection - Why Use Transformations?

César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten

Proceedings of the VLDB'94, 1994