Relational calculus

Known as: Relational 
Relational calculus consists of two calculi, the tuple relational calculus and the domain relational calculus, that are part of the relational model… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
MAIN TEXT A natural temporal extension of the relational calculus allows explicit variables and quantification over a given time… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The expressive power of first-order query languages with several classes of equality and inequality constraints is studied in… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Not all queries in relational calculus can be answered sensibly when disjunction, negation, and universal quantification are… (More)
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Relaxing the assumption that relations are always in First-Normal-Form (1NF) necessitates a reexamination of the fundamentals of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In commercial network database management systems, set-valued fields and aggregate functions are commonly supported. However, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Aggregate functtons m relattonal query languages allow intricate reports to be written. In this paper aggregate functions are… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language… (More)
Is this relevant?
Highly Cited
1972
Highly Cited
1972
In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. This… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1971
Highly Cited
1971
  • E. F. Codd
  • IBM Research Report, San Jose, California
  • 1971
Three principal types of language for data base manipulation are identified: the low-level, procedure-oriented (typified by the… (More)
  • table I
  • figure 2
Is this relevant?