Join Ordering
Join Ordering is a query optimization method that determines the optimal sequence of joining relations to minimize execution cost in relational database systems.
246
Publications
18.3K
Citations
561
Authors
210
Institutions
Publications per year
2017–2026
37
Parents
246
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Ron Avnur, Joseph M. Hellerstein · ACM SIGMOD Record · 2000 · 795 citations
How good are query optimizers, really?
Viktor Leis, Andrey Gubichev, Atanas Mirchev et al. · Proceedings of the VLDB Endowment · 2015 · 673 citations · Full text
An overview of query optimization in relational systems
Surajit Chaudhuri · 1998 · 619 citations · Full text
Thomas Neumann, Gerhard Weikum · Proceedings of the VLDB Endowment · 2008 · 561 citations
1–5 of 246
561
10
h-index
9
h-index
University of California, Berkeley, United States
6 publications · 1.7K citations
6
h-index
5
h-index
5
h-index
1–5 of 561
210
IBM (United States)
Armonk, United States
12 h-index
35 publications
12.6K citations
University of Wisconsin–Madison
Madison, United States
11 h-index
19 publications
1.6K citations
University of California, Berkeley
Berkeley, United States
10 h-index
25 publications
4.6K citations
University of Mannheim
Mannheim, Germany
8 h-index
15 publications
718 citations
IBM Research - Almaden
San Jose, United States
8 h-index
20 publications
972 citations
Microsoft (United States)
Redmond, United States
6 h-index
10 publications
859 citations
Stanford University
Stanford, United States
6 h-index
9 publications
501 citations

University of Waterloo
Waterloo, Canada
6 h-index
14 publications
1.4K citations
1–8 of 210
PVLDB · 18 publications · 2.3K citations
17
h-index
11 publications · 1.2K citations
11
h-index
10 publications · 1.1K citations
10
h-index
TODS · 10 publications · 664 citations
10
h-index
TKDE · 7 publications · 318 citations
7
h-index
1–5