Synonyms
Cross product
Definition
Given two relation instances R1, over set of attributes U1, and R2, over set of attributes U2 – with U1 and U2 disjoint – the Cartesian product R1 × R2 returns a new relation, over set of attributes U1 ∪ U2, consisting of tuples {t|t(U1) ∈ R1 and t(U2) ∈ R2}. Here t(U) denotes the restriction of the tuple t to attributes in the set U.
Key Points
The Cartesian product is an operator of the relational algebra which extends to relations the usual notion of Cartesian product of sets.
Since the sets of attributes of the input relations are disjoint, in R1 × R2, each tuple of R1 is combined with each tuple of R2; moreover the arity of the output relation is the sum of the arities of R1 and R2.
As an example, consider a relation Students over attributes (student-number, student-name), containing tuples {(1001, Black), (1002, White)}, and a relation Courses over attributes (course-number, course-name), containing tuples {(EH1, Databases), (GH5, Logic)}. Then Students...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Sirangelo, C. (2018). Cartesian Product. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1259
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1259
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering