Skip to search formSkip to main contentSkip to account menu

Relational algebra

Known as: Natural join, Relational logic, Relational 
Relational algebra, first created by E.F. Codd while at IBM, is a family of algebras with a well-founded semantics used for modelling the data stored… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a… 
2004
2004
We present a static technique for finding bugs in object-oriented procedures. It is capable of checking complex user-defined… 
Highly Cited
2000
Highly Cited
2000
From the Publisher: A detailed study of the impact of objects and type theory on the relational model of data, including a… 
2000
2000
In a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site… 
1989
1989
A partition-and-replicate strategy for processing distributed queries referencing no fragmented relation is sketched. An… 
Highly Cited
1988
Highly Cited
1988
A reduced cover set of the set of full reducer semijoin programs for an acyclic query graph for a distributed database system is… 
Highly Cited
1985
Highly Cited
1985
A summary table IS a tabular representation of summary data, and 1s a useful data structure for statlstlcal databases Prlnutlve… 
1983
1983
A summary table is one of the useful data structures used in statistical databases. For an algebraic summary table manipulation… 
1982
1982
In a distributed database environment, finding the optimal strategy which fully reduces all relations referenced by a general…