Tuple Relational Calculus
(Redirected from tuple relational calculus)
Jump to navigation
Jump to search
A Tuple Relational Calculus is a relational calculus that ...
- See: Calculus (Disambiguation), Edgar F. Codd, Relational Model, Data Model, QUEL Query Languages, SQL, Relational Database Management System, Michel Lacroix, Alain Pirotte, Domain Calculus, First-Order Predicate Calculus, Relational Algebra.
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/tuple_relational_calculus Retrieved:2014-8-6.
- Tuple calculus is a calculus that was introduced by Edgar F. Codd as part of the relational model, in order to provide a declarative database-query language for this data model. It formed the inspiration for the database-query languages QUEL and SQL, of which the latter, although far less faithful to the original relational model and calculus, is now the de-facto-standard database-query language; a dialect of SQL is used by nearly every relational-database-management system. Lacroix and Pirotte proposed domain calculus, which is closer to first-order logic and which showed that both of these calculi (as well as relational algebra) are equivalent in expressive power. Subsequently, query languages for the relational model were called relationally complete if they could express at least all of these queries.
1970
- (Codd, 1970) ⇒ Edgar F. Codd. (1970). “A Relational Model of Data for Large Shared Data Banks.” In: Communications of the ACM, 13(6).