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

Authors

848

  1. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    13 publications · 693 citations

    11

    h-index

  2. YS
    Yehoshua Sagiv

    Hebrew University of Jerusalem, Israel

    6 publications · 239 citations

    6

    h-index

  3. MC
    Ming-Syan Chen⋆

    National Taiwan University, Taiwan

    6 publications · 117 citations

    6

    h-index

  4. JM
    Jignesh M. Patel

    University of Wisconsin–Madison, United States

    4 publications · 239 citations

    6

    h-index

  5. DS
    Divesh Srivastava

    AT&T (United States), United States

    5 publications · 314 citations

    5

    h-index

1–5 of 848

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 21 publications · 1.2K citations

    17

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 20 publications · 718 citations

    15

    h-index

  3. ACM SIGMOD Record

    14 publications · 1.1K citations

    13

    h-index

  4. ACM Transactions on Database Systems

    TODS · 15 publications · 1.8K citations

    13

    h-index

  5. arXiv (Cornell University)

    Repository · 8 publications · 168 citations

    8

    h-index

1–5