Relational Completeness

Relational Completeness is a theoretical property of a query language that signifies its capability to express all queries that can be formulated in the relational algebra, thereby serving as a benchmark for the expressive power of database query systems within the relational data model.

57

Publications

3K

Citations

87

Authors

61

Institutions

Publications per year

2017–2026

1

Authors

87

  1. AO
    A. Ola

    North Carolina State University, United States

    3 publications · 67 citations

    3

    h-index

  2. PC
    Paris C. Kanellakis

    Brown University, United States

    3 publications · 453 citations

    3

    h-index

  3. SA
    Serge Abiteboul

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 453 citations

    3

    h-index

  4. GG
    Gösta Grahne

    Concordia University, Canada

    3 publications · 453 citations

    3

    h-index

  5. AP
    Antonella Poggi

    Sapienza University of Rome, Italy

    2 publications · 57 citations

    2

    h-index

1–5 of 87

Venues

  1. ACM Transactions on Database Systems

    TODS · 2 publications · 75 citations

    2

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 2 publications · 108 citations

    2

    h-index

  3. Very Large Data Bases

    Conference · 2 publications · 73 citations

    2

    h-index

  4. 2

    h-index

  5. Logic Journal of IGPL

    2 publications · 29 citations

    2

    h-index

1–5