Query Plan Enumeration
Query Plan Enumeration is a systematic method in query optimization that generates and evaluates alternative execution plans for a database query by exploring the space of logically equivalent query representations to identify optimal or near-optimal plan candidates based on cost or performance criteria.
56
Publications
3.3K
Citations
137
Authors
54
Institutions
Publications per year
2017–2026
16
Parents
56
How good are query optimizers, really?
Viktor Leis, Andrey Gubichev, Atanas Mirchev et al. · Proceedings of the VLDB Endowment · 2015 · 673 citations · Full text
Jason McHugh, Jennifer Widom · 1999 · 327 citations
Deep Reinforcement Learning for Join Order Enumeration
Ryan Marcus, Olga Papaemmanouil · 2018 · 217 citations · Full text
Measuring the complexity of join enumeration in query optimization
Kiyoshi Ono, Guy M. Lohman · 1990 · 159 citations
1–5 of 56
137
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 137
54
Microsoft (United States)
Redmond, United States
5 h-index
9 publications
239 citations
Stanford University
Stanford, United States
5 h-index
9 publications
1.2K citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
15 publications
1K citations
University of Mannheim
Mannheim, Germany
4 h-index
9 publications
156 citations

University of Waterloo
Waterloo, Canada
4 h-index
6 publications
143 citations
IBM (United States)
Armonk, United States
3 h-index
9 publications
279 citations
University of Washington
Seattle, United States
3 h-index
3 publications
283 citations

Indian Institute of Science Bangalore
Bengaluru, India
3 h-index
9 publications
398 citations
1–8 of 54
PVLDB · 8 publications · 848 citations
9
h-index
3 publications · 68 citations
3
h-index
2 publications · 46 citations
2
h-index
TKDE · 2 publications · 50 citations
2
h-index
TODS · 2 publications · 140 citations
2
h-index
1–5