Join Operations
Join Operations is a binary operation in order theory that, given two elements in a partially ordered set, yields their least upper bound when it exists, thereby characterizing the supremum with respect to the partial order.
371
Publications
34.7K
Citations
848
Authors
330
Institutions
Publications per year
2017–2026
58
Variants
Least Upper Bound Operation
Parents
371
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
Ion Stoica, Robert Morris, David R. Karger et al. · ACM SIGCOMM Computer Communication Review · 2001 · 1.9K citations
Optimal implementation of conjunctive queries in relational data bases
Ashok K. Chandra, Philip M. Merlin · 1977 · 1.2K citations · Full text
Indexing and Querying XML Data for Regular Path Expressions
Quanzhong Li, Bongki Moon · 2001 · 761 citations
1–5 of 371
848
11
h-index
6
h-index
6
h-index
6
h-index
5
h-index
1–5 of 848
330
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
14 h-index
30 publications
4.2K citations
University of Wisconsin–Madison
Madison, United States
13 h-index
22 publications
2.6K citations
IBM (United States)
Armonk, United States
12 h-index
27 publications
1.7K citations
IBM Research - Almaden
San Jose, United States
11 h-index
26 publications
2.3K citations
University of California, Berkeley
Berkeley, United States
10 h-index
13 publications
15.8K citations
Stanford University
Stanford, United States
9 h-index
15 publications
1.4K citations
Microsoft (United States)
Redmond, United States
7 h-index
11 publications
963 citations

University of Waterloo
Waterloo, Canada
7 h-index
12 publications
268 citations
1–8 of 330
PVLDB · 21 publications · 1.2K citations
17
h-index
TKDE · 20 publications · 718 citations
15
h-index
14 publications · 1.1K citations
13
h-index
TODS · 15 publications · 1.8K citations
13
h-index
Repository · 8 publications · 168 citations
8
h-index
1–5