Exploring-the-Investigative-World-of-Science.pdf/8th class curiosity/1st chap...Sandeep Swamy
EXCRETION-STRUCTURE OF NEPHRON,URINE FORMATIONraviralanaresh2
Introduction to pediatric nursing in 5th Sem..pptxAneetaSharma15
Modul Ajar Deep Learning Bahasa Inggris Kelas 11 Terbaru 2025wahyurestu63
Basics and rules of probability with real-life usesravatkaran694
Continental Accounting in Odoo 18 - Odoo SlidesCeline George
Rules and Regulations of Madhya Pradesh Library Part-ISantoshKumarKori2
Ad
Learning of L2 Codd's Rules 7-12 in DBMS.pptx
1. Sanjivani Rural Education Society’s
Sanjivani College of Engineering, Kopargaon-423 603
(An Autonomous Institute, Affiliated to Savitribai Phule Pune University, Pune)
NACC ‘A’ Grade Accredited, ISO 9001:2015 Certified
Department of Computer Engineering
(NBA Accredited)
Prof. Monika Agrawal
Assistant Professor
E-mail : [email protected]
Contact No: 8770361037
Course:CO210
Database Management System
Lecture-02 Codd’s Rules (7-12)
3. RULE 7 : HIGH-LEVEL INSERT , UPDATE AND DELETE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 3
This rule states that insert, update, and delete operations should be
supported for any retrievable set rather than just for a single row in
a single table.
It also perform the operation on multiple row simultaneously .
There must be delete, updating and insertion at the each level of
operation. Set operation like union, all union , insertion and minus
should also supported.
EXAMPLE:
Suppose if we need to change ID then it will reflect
everywhere automatically.
4. RULE 8 :LOGICAL DATA INDEPENDENCE RULE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 4
• What is independence?
The ability to modify schema definition in on level without affecting schema
definition in the next higher level is called data independence
• The ability to change the logical (conceptual) schema without changing
the External schema (User View) is called logical data independence.
• EXAMPLE:
The addition or removal of new entities, attributes, or relationships to the
conceptual schema should be possible without having to change existing
external schemas or having to rewrite existing application programs.
6. RULE 9:PHYSICAL DATA INDEPENDENCE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 6
• The ability to change the physical schema without changing the logical schema
is called physical data independence.
• This is saying that users shouldn’t be concerned about how the data is stored or
how it’s accessed. In fact, users of the data need only be able to get the basic
definition of the data they need.
• EXAMPLE:
A change to the internal schema, such as using different file organization or
storage structures, storage devices, or indexing strategy, should be possible
without having to change the conceptual or external schemas.
7. RULE 10 : INTEGRITY INDEPENDENCE RULE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 7
• Data integrity refers to maintaining assuring the accuracy
and consistency of data over its entire life cycle.
1. First insure that correct data type is used.
2. Check constraints: these allow column value to be checked
against other column before insertion is allowed.
8. RULE 11 : DISTRIBUTION INDEPENDECE RULE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 8
• “THE RELATION DATA BASE MANAGEMENT HAS DISTRIBUTION INDEPENDENCE”
• Distribution independence implies that user should not have to be aware
of whether a database is distributed at different sites or not.
• Application program and adhoc request are not affected by the change
in distribution of physical data. Application program will work even if the
programs and data are moved on different site
• The RDBMS may spread across the more one system or several networks
9. RULE 12 : NON-SUBVERSION RULE
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 9
• There should be no way to modify to database structure other then through the
multiple row data base language(SQL).
Example:
A relational system has a low-level (single-record-at-a-time) language, that low
level cannot be used to subvert or bypass the integrity Rules and constraints
expressed in the higher level relational language (multiple-records-at-a-time).”
