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
Parents
57
RELATIONAL COMPLETENESS OF DATA BASE SUBLANGUAGES
E. F. Codd · 2000 · 473 citations
Obtaining Complete Answers from Incomplete Databases
Alon Y. Levy · 1996 · 139 citations
1–5 of 57
87
3
h-index
3
h-index
Institut national de recherche en sciences et technologies du numérique, France
3 publications · 453 citations
3
h-index
3
h-index
2
h-index
1–5 of 87
61
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
5 publications
532 citations

University of Edinburgh
Edinburgh, United Kingdom
4 h-index
6 publications
183 citations
Brown University
Providence, United States
3 h-index
3 publications
453 citations

University of Helsinki
Helsinki, Finland
3 h-index
3 publications
453 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
2 h-index
2 publications
57 citations
North Carolina State University
Raleigh, United States
2 h-index
2 publications
56 citations
IBM (United States)
Armonk, United States
2 h-index
4 publications
348 citations

Birkbeck, University of London
London, United Kingdom
2 h-index
2 publications
21 citations
1–8 of 61
TODS · 2 publications · 75 citations
2
h-index
TKDE · 2 publications · 108 citations
2
h-index
Conference · 2 publications · 73 citations
2
h-index
2 publications · 66 citations
2
h-index
2 publications · 29 citations
2
h-index
1–5