Relational Algebra

Relational Algebra is a formal algebraic query language in relational database theory that operates on relations as operands and uses a closed set of well-defined operators (such as selection, projection, union, difference, and Cartesian product) to specify and compose queries with precise semantics.

5K

Publications

315.3K

Citations

6.8K

Authors

1.5K

Institutions

Publications per year

2017–2026

388

Authors

6.8K

  1. LL
    Leonid Libkin

    University of Edinburgh, United Kingdom

    53 publications · 2.5K citations

    30

    h-index

  2. DS
    Dan Suciu

    University of Washington, United States

    48 publications · 3.5K citations

    29

    h-index

  3. YS
    Yehoshua Sagiv

    Hebrew University of Jerusalem, Israel

    36 publications · 4.1K citations

    26

    h-index

  4. JD
    Jeffrey D. Ullman

    Stanford University, United States

    33 publications · 5.2K citations

    24

    h-index

  5. SC
    Surajit Chaudhuri

    Microsoft (United States), United States

    27 publications · 6.2K citations

    22

    h-index

1–5 of 6.8K

Venues

  1. ACM Transactions on Database Systems

    TODS · 190 publications · 24.5K citations

    74

    h-index

  2. ACM SIGMOD Record

    158 publications · 12.7K citations

    59

    h-index

  3. Very Large Data Bases

    Conference · 111 publications · 7K citations

    45

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 123 publications · 7.4K citations

    45

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 126 publications · 7.3K citations

    45

    h-index

1–5