Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,344 papers from all fields of science
Search
Sign In
Create Free Account
Relational algebra
Known as:
Natural join
, Relational logic
, Relational
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Aggregate function
Apache Calcite
Apache UIMA
Atomic formula
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Map-reduce-merge: simplified relational data processing on large clusters
Hung-chih Yang
,
Ali Dasdan
,
R. Hsiao
,
D. S. Parker
ACM SIGMOD Conference
2007
Corpus ID: 1908319
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
RankSQL: query algebra and optimization for relational top-k queries
Chengkai Li
,
K. Chang
,
Ihab F. Ilyas
,
Sumin Song
ACM SIGMOD Conference
2005
Corpus ID: 5432512
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of…
Expand
Highly Cited
2003
Highly Cited
2003
Preference formulas in relational queries
J. Chomicki
TODS
2003
Corpus ID: 14011402
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others…
Expand
Highly Cited
2002
Highly Cited
2002
Structural joins: a primitive for efficient XML query pattern matching
S. Al-Khalifa
,
H. Jagadish
,
Nick Koudas
,
J. Patel
,
D. Srivastava
,
Yuqing Wu
Proceedings / International Conference on Data…
2002
Corpus ID: 7798629
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured…
Expand
Review
1992
Review
1992
Join processing in relational databases
Priti Mishra
,
M. Dunham
CSUR
1992
Corpus ID: 14526683
The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information…
Expand
Highly Cited
1987
Highly Cited
1987
Extending relational algebra and relational calculus with set-valued attributes and aggregate functions
G. Özsoyoglu
,
Z. M. Özsoyoglu
,
V. Matos
TODS
1987
Corpus ID: 17130162
In commercial network database management systems, set-valued fields and aggregate functions are commonly supported. However, the…
Expand
Highly Cited
1984
Highly Cited
1984
Generalizing Database Relational Algebra for the Treatment of Incomplete/Uncertain Information and Vague Queries
H. Prade
,
C. Testemale
Information Sciences
1984
Corpus ID: 24699191
Highly Cited
1982
Highly Cited
1982
The complexity of relational query languages (Extended Abstract)
Moshe Y. Vardi
Symposium on the Theory of Computing
1982
Corpus ID: 7869248
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
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Anthony C. Klug
JACM
1982
Corpus ID: 38402199
Aggregate functtons m relattonal query languages allow intricate reports to be written. In this paper aggregate functions are…
Expand
Highly Cited
1972
Highly Cited
1972
Relational Completeness of Data Base Sublanguages
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE