Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
Highly Cited
2005
Highly Cited
2005
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Highly Cited
2003
Highly Cited
2003
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others… Expand
  • figure 1
  • table I
  • table II
  • figure 4
  • figure 5
Review
1992
Review
1992
The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Highly Cited
1986
Highly Cited
1986
Abstract Motivated by new applications of database systems we introduce relations which may have relation-valued attributes and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Highly Cited
1984
Highly Cited
1984
Abstract This paper deals with relational databases which are extended in the sense that fuzzily known values are allowed for… Expand
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… Expand
Highly Cited
1982
Highly Cited
1982
Aggregate functtons m relattonal query languages allow intricate reports to be written. In this paper aggregate functions are… Expand
Highly Cited
1981
Highly Cited
1981
We present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
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… Expand
  • figure 1
  • table 1
  • table 1
  • table 2