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.
Highly Cited
2007
Highly Cited
2007
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process a vast amount of… 
Highly Cited
2005
Highly Cited
2005
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of… 
Highly Cited
2003
Highly Cited
2003
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others… 
Highly Cited
2000
Highly Cited
2000
From the Publisher: Three well-known computer scientists at Stanford University-Hector Garcia-Molina, Jeffrey D. Ullman, and… 
Review
1992
Review
1992
The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information… 
Highly Cited
1987
Highly Cited
1987
In commercial network database management systems, set-valued fields and aggregate functions are commonly supported. However, the… 
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… 
Highly Cited
1982
Highly Cited
1982
Aggregate functtons m relattonal query languages allow intricate reports to be written. In this paper aggregate functions are… 
Highly Cited
1972
Highly Cited
1972
  • E. Codd
  • Research Report / RJ / IBM / San Jose, California
  • 1972
  • Corpus ID: 41445196
In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. This…