Relational Databases-Distributive Database System-Lecture Slides, Slides of Distributed Database Management Systems

This lecture was delivered by Prof. Mriganka Rao for Distributive Database System at Anna University of Technology. It includes: Relational, Databases, Model, Record, Semantic, Hierarchical, Network, Relational, Strengths, Components

Typology: Slides

2011/2012

Uploaded on 07/19/2012

cool_bre
cool_bre 🇮🇳

4.3

(4)

27 documents

1 / 73

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
In the name of Allah
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49

Partial preview of the text

Download Relational Databases-Distributive Database System-Lecture Slides and more Slides Distributed Database Management Systems in PDF only on Docsity!

In the name of Allah

Distributed Database Systems

(CS-5323)

Spring 2012

Relational Databases

Dept of CS, MAJU, Ibd

Data Model  A set of tools/ constructs used to model a database  Record/Semantic

Dept of CS, MAJU, Ibd

Relational Data Model

 Two major Strengths  Three Components  Relational databases based on relational DM

Dept of CS, MAJU, Ibd

 A relation R defined over domains D

, D

, …., D

n

is a set of n-tuples, <d

, d

, …, d

n

such that <d

 D

……, d

n

D

n

Formalism

Dept of CS, MAJU, Ibd

eNo eName eTitle eSal pNo eResp eDur 12 7 12 15 10 10 Work Mangr Cons Cons Cons Mangr

P
P
P
P
P
P

Supr Desin Prog Eng Prog Anlyst Naeem Rahila Narjis Aslam Hafeez Liaqat

E
E
E
E
E
E

Dept of CS, MAJU, Ibd

 Each of the attribute in these two relations has a domain, like…  Domains need not to be distinct

Characteristics of DB Relations

Dept of CS, MAJU, Ibd

 Minimum nonempty subset of a relation whose values uniquely identify each tuple in relation

Primary Key

Dept of CS, MAJU, Ibd

 The superset of the key is super key, like…  We also have candidate, alternate, secondary, foreign key

Keys

Dept of CS, MAJU, Ibd

 Three Normal Forms  BCNF  Lossless decomposition  Dependency preservation

Normalization

Dept of CS, MAJU, Ibd

Dependency Structure

 Norm. based on dependencies  Up to BCNF on FDs  MVD and P-JD

Dept of CS, MAJU, Ibd

Basic Normal Forms

 1 st: A relation is in first normal form iff every attribute in every tuple contains an atomic value or there is no multivaued (repeating group) in the relation  2 nd: A relation is in 2nd^ normal form iff it is in the first normal form and all non key attributes are fully functionally dependent on key, that is, there is no partial dependency  3 rd: A table is in third normal form (3NF) iff it is in 2NF and there is no transitive dependency, that is, no non-key attribute is dependent on another non-key attribute  BCNF: A table is in BCNF if every determinant is a candidate key

Multivalued Dependency