Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
An in-depth exploration of the relational database management system (rdbms), focusing on concepts, tables, keys, and operations. It delves into the structure of tables, primary and composite keys, candidate keys, alternate keys, and foreign keys. The document also covers various rdbms operations such as selection, projection, join, union, and renaming. It offers practical examples to illustrate these concepts.
Typology: Study notes
1 / 14
This page cannot be seen from the preview
Don't miss anything!
RetaTonal edeta^ modet.
n tetational^ data^ bse -1n oelaticn^ al^ databate^ management
ot Habies, ach-^ ath^ asi qme4^ uHh^ a^ uhique i4entication, consíder a^ relaHon^ (table),^ STUDeNT
AbDRESs ae^ refoesenteeAibuter.^ as^ fottòws.
Bhacm
ADoREss
x Shm mech CivI (^) X
Coneept^ (tmpeot^ ant^ termincleY
tonvert -the^ cernccptual^ mecl^
e oetation a!^ data^ odot^
uhich tan
be impeh^ ented^ ucing^ any (quag titt eral,^ 9,ng^ ny^ sq*
egRanm oor1T x* b column :The cotumn eresentr the Set valuer tor a -the Colmn broun ch (^) have the
-fhe COlLLmn
Geatm c^ vauy^ and atsibctedomai,
mech
STUC
)Retat^ on^ a) the^ instante^ :ptes
retalionat inrtane. tuden -tabte^ Gudent
0n deietto, pdate^ Tn^ -edat^ a^ b^ ase
Ko that^ ane^ tused^ to^ tdentty^ the rows or^ aåto^ help.^ to^ idertt^
by table, thi {he^ Ieneetn g yee.
DH - 12/oul
|. Supe^ Key^ .T+^ is^ a^ et^ o^ one^ or more attibutehat^ artow^
-o
Rit Citu 002
CSe
910 ho. 1234 Mech
Supar So Sname S3 S (^) hame, S (^) rott no (^) SIbno.
candid atz key.
candid cte^ key^ einzd^ sthe
retation at^ le^ ast^ onte^ in^ aable. Tn a^ Gtudent^ ab|e^ th^
ottibcte name,
roltno, Haig{hen^ candid^ ati^ ey^
(mínimum no.^ ot
a (^) cotumn uhene (^) vaut (^) ane eame as^ he^ pimany^ y^ ot^ an^ nothen^ fable. -14 Combana (tabte)^ at^ a^ time, they
uLo or^ more^ relatfon
Cross reerente
are he Onetabte wed^ to^ Point^ tb^ -Ihe^ primary Key o^ ancihe^ table.
qitu
$. Branth
MeCh
Stdent 2 D nod (^) n
/Foregn y
44 34..
G} Aternate Key seccnd arg
-The atenatt^ y^ or^ ce condany that (^) hcs hot celected^ t be a (^) roimary (^) ky bct^ aTe^ candidate
for the (^) simay
as a Candidate
are he^ Condi^ dato Koy which^ ú^
aternale (^) key
the candidale
aMernate or^ caccndany^ ky
Relational
-^14 u^ tanguage., H qivea a Proces Dbtain^ esut
Aoundation (^) or getati^ onal
Queries -
a data tu^ Nc^ eM^ ,manuplal aelati onal datob^ ar^ hen o2quined , the (^) tynta
Cpeci ic^ eyntan
Adrecs
Atnet (^602601) PLA
*Tind an^ ingo^ cKcdenit^
Tname = Cita and^ addoeLs=^ PKp" Litttome
123-.
(^2345) Rita
an4 (^) t (^) namRam ) and Phone^ o6.^ =^ M
a Pouject^ (peraton
-toble nd^ Aiscat^ t^ -he^ othen^ CoLmy.
rE eemin^ ce^ d^ brm
<Abíbute úst^ >R. Tt is^ dencted^ by^ -the^ ymho whee is^ the^
ymbol ued^ to
ct operatin
-he út^ O^ ttibuter^. 6om the^ bibutey
ame
Ro11 n0. O
pLA
nae n^ -he^ Gtuden4^ jable 7T Name^ (S4udent)
table
qenoted (^) Symbot
tname Csudast)^ ^^ Nnane^ (studsnt^ 2) tudet
C
C opeyation.
eesent
Tnams tud.^ I^
Aradm e^ Shud.^ 2.^ where.
03
Nqmne
Cartttion oporalion^ -tuo dibLerent
y
NaOn AharsO AC2.
Ctud 2
PLA
O
le namC opaation.
cuetfut aelation
renam e name (^) o (^) eLpaeni (^) n
with (^) save ame
