(redirected from Relational algebra)
Also found in: Thesaurus, Legal, Encyclopedia, Wikipedia.


1. Of or arising from kinship.
2. Indicating or constituting relation.
3. Grammar Of, relating to, or being a word or particle, such as a conjunction or preposition, that expresses a syntactic relation between elements in a phrase or sentence.

re·la′tion·al·ly adv.


1. (Grammar) grammar indicating or expressing syntactic relation, as for example the case endings in Latin
2. having relation or being related
3. (Computer Science) computing based on data stored in a tabular form: a relational database.


(rɪˈleɪ ʃə nl)

1. of or pertaining to relations.
2. indicating or specifying some relation.
3. (of a word) serving to indicate relations between elements in a sentence, as a preposition (contrasted with notional).
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.relational - having a relation or being related
relative, comparative - estimated by comparison; not absolute or complete; "a relative stranger"


[rɪˈleɪʃənl] ADJrelacional


adjrelational; relational database (Comput) → relationale Datenbank
References in periodicals archive ?
The definitions of temporal relational operators used in the temporal relational algebra are different from that of the conventional relational algebra as they support time element.
Next, we will design a new-generation query language inspired by classic relational algebra and extended with orthogonal, domain-specific abstractions for genomics.
In the second step, we analyse the queries and extract the operations from extended relational algebra expressions.
Relational Algebra and###Effective usage of relational algebra using mathematics
This edition has new features and some reorganization, expanded relational algebra coverage with formal definitions and notations, updated business vignettes showing the real-world impact of database technologies, updated coverage of cloud data services, expanded coverage of big data and related Hadoop technologies, added information on data visualization, and expanded information on SQL to include MySQL databases.
An abstract heterogeneous relational algebra is an algebraic structure (R, [union], [intersection], -, [??], [omicron], [empty set], L, I) on a nonempty set R of elements called relations, such that the next conditions are satisfied.
SELECT afc.ACTOR, afc.N_FILMS AS "Number of films" FROM (SELECT DISTINCT CONCAT(A.first_name, ", A.last_name) AS "ACTOR", COUNT(FA.film_id) AS N_FILMS FROM ACTOR A, FILM_ACTOR FA WHERE A.actor_id = FA.actor_id GROUP BY A.actor_id, A.first_name, A.last_name ORDER BY COUNT(FA.film_id) DESC) AS afc WHERE afc.N_FILMS + 9 >= (SELECT MAX(fcounts) FROM (SELECT count(*) as fcounts FROM actor a, film_actor fa WHERE a.actor_id = fa.actor_id GROUP BY a.actor_id) as temp ); Overall, the set of the 30 problems in SQL queries requires students to learn and understand a variety of general SQL techniques as well as specific MySQL features, such as group functions, simulation of the division operator of the relational algebra, regular expressions, full text search, and performance optimization.
The semantics is described by means of an extended relational algebra with new operators: Group by, Unnest, Extend, Substitute, Rename, Powerset, which transform a relational table into an object-relational table (i.e.
In this paper, and following the approach of Cox (1995), the authors also focus on the use of fuzzy logic in the formulation of queries against a standard relational database using relational algebra. By the latter term we mean a formal system for manipulating relations.
By f, t we denote empty set 0 and singleton set {<>}, respectively (with the empty tuple <> i.e., the unique tuple of 0-ary relation), which may be thought of as falsity f and truth t, as those used in the relational algebra. For a given domain D, we define that [D.sup.0] is a singleton set {(}}, so that {f, t} = P([D.sup.0]), where P is the powerset operator.
Beginning with an overview of foundational principles and the basics of relations, topics discussed include types and domains, relations, rows and tables, duplicates, SQL and relational algebra, constraints, views, SQL logic, and logically formulated SQL expressions.
Hierarchical data, for example, can be folded into a relation, but its containment relationships cannot be captured by the relational data model with the expressive power of the relational algebra [3].

Full browser ?