EDBT 2026 Demo / reviewers in the wild / expert

Arjan Pellenkoft

dblp:82/99 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
join enumeration		 0.011997
The Complexity of Transformation-Based Join Enumeration · VLDB 1997
Query processing and optimization › query optimization
join ordering		 0.011994
Fast, Randomized Join-Order Selection - Why Use Transformations? · VLDB 1994
Query processing and optimization
query optimization		 0.011994
Fast, Randomized Join-Order Selection - Why Use Transformations? · VLDB 1994

Methods — techniques the papers use, named apart from their topics

randomized algorithm · 0.0
YearPublicationVenuePosition
1997 Duplicate-Free Generation of Alternatives in Transformation-Based Optimizers
Arjan Pellenkoft, César A. Galindo-Legaria, Martin L. Kersten
 DASFAA1
1997 The Complexity of Transformation-Based Join Enumeration
Arjan Pellenkoft, César A. Galindo-Legaria, Martin L. Kersten
 VLDB1
1995 Uniformly-Distributed Random Generation of Join Orders
César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten
 ICDT2
1994 Fast, Randomized Join-Order Selection - Why Use Transformations?
César A. Galindo-Legaria, Arjan Pellenkoft, Martin L. Kersten
 VLDB2