Preview

Data Integrity

Satisfactory Essays
Open Document
Open Document
500 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Data Integrity
Types of Data Integrity
This section describes the rules that can be applied to table columns to enforce different types of data integrity.

Null Rule
A null rule is a rule defined on a single column that allows or disallows inserts or updates of rows containing a null (the absence of a value) in that column.

Unique Column Values
A unique value rule defined on a column (or set of columns) allows the insert or update of a row only if it contains a unique value in that column (or set of columns).

Primary Key Values
A primary key value rule defined on a key (a column or set of columns) specifies that each row in the table can be uniquely identified by the values in the key.

Referential Integrity Rules
A referential integrity rule is a rule defined on a key (a column or set of columns) in one table that guarantees that the values in that key match the values in a key in a related table (the referenced value).

Referential integrity also includes the rules that dictate what types of data manipulation are allowed on referenced values and how these actions affect dependent values. The rules associated with referential integrity are:

•Restrict: Disallows the update or deletion of referenced data.

•Set to Null: When referenced data is updated or deleted, all associated dependent data is set to NULL.

•Set to Default: When referenced data is updated or deleted, all associated dependent data is set to a default value.

•Cascade: When referenced data is updated, all associated dependent data is correspondingly updated. When a referenced row is deleted, all associated dependent rows are deleted.

•No Action: Disallows the update or deletion of referenced data. This differs from RESTRICT in that it is checked at the end of the statement, or at the end of the transaction if the constraint is deferred. (Oracle uses No Action as its default action.)

Complex Integrity Checking
Complex integrity checking is a user-defined rule for a column (or set of

You May Also Find These Documents Helpful

  • Satisfactory Essays

    PT2520 Unit7Labs Tramil

    • 330 Words
    • 1 Page

    13. What is referential integrity? Exists when every foreign key relates to an existing primary key. There are no orphan records in child tables that have no reference in a parent table.…

    • 330 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    6 T | Normal forms are sets of rules designed to remove anomalies and redundancy from database design.…

    • 313 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    It203 Homework 5

    • 319 Words
    • 2 Pages

    5. What restrictions does referential integrity place on the way data is entered into tables?…

    • 319 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Referential Integrity exists when every foreign key relates to an existing primary key. There are no orphan records in child tables that have no reference in a parent table.…

    • 327 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    4. (TCO 2) A field or set of fields used to uniquely identify a record in a table is (Points : 4)…

    • 368 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Pt2520 Final Answers 1/3

    • 329 Words
    • 2 Pages

    what best describes the function of a foreign key. the primary key repeated in another table to show relation…

    • 329 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Referential Integrity empowers you to administer a predictable and approved database. Case in point, in a patient database you may need to guarantee that no patients could be entered into the framework without an extraordinary patient ID. Else, you could wind up with a failure to rapidly record, sort and discover patients who have comparing scenes of forethought, errands, authentic cases, and so on.…

    • 1097 Words
    • 4 Pages
    Powerful Essays
  • Satisfactory Essays

    Lab 204 Quiz

    • 2478 Words
    • 10 Pages

    You follow certain step’s to access the supplementary readings for a course when u sing your organizations library management system. These steps that you follow are examples of the _________ components of an information system.…

    • 2478 Words
    • 10 Pages
    Satisfactory Essays
  • Powerful Essays

    IST223 Crib sheet

    • 3425 Words
    • 7 Pages

    rectangles, and relationships are shown by lines between the rectangles. Attributes are generally listed within the rectangle. The many side of many relationships is represented by a crows footentity-relationship (E-R) modelA set of constructs and conventions used to create data models. The things in the users world are represented by entities, and the associations among those things are represented by relationships. The results are usually documented in an entity-relationship (E-R) diagramID-dependent entityan entity whose identifier includes the identifier of another entityidentifierwhich are attributes that name, or identify, entity instancesidentifying relationshipIn such relationships, the parent is always required, but the child (the ID-dependent entity) may or may not be required, depending on application requirements. Identifying relationships are shown with solid lines in E-R diagrams.is-aRelationships among supertype/subtype entitiesmandatoryat least one entity instance must participate in the relationshipmaximum cardinalityThe maximum cardinality is the maximum number of entity instances that can participate in a relationship instance.minimum cardinalityThe minimum cardinality is the minimum number of entity instances that must participate in a relationship instance.nonidentifying relationshiprelationship drawn with a dashed line (refer to Figure 5-7) is used between strong entities and is called a nonidentifying relationship because there are no ID-dependent entities in the relationship.null valueare a problem because they are ambiguous. They can mean that a value is inappropriate, unknown, or known, but not yet been entered into the databaseparentAn entity or row on the one side of a one-to-many relationshiprecursive relationshipoccurs when an entity type has a relationship to itself.relationship classAssociations among entity classesrelationship instanceassociations among entity instances.strong entityan entity that represents something that can exist…

    • 3425 Words
    • 7 Pages
    Powerful Essays
  • Satisfactory Essays

    cis3730_Exam1_Studyguide

    • 512 Words
    • 2 Pages

    Be able to give examples of tables, specify their primary keys, and explain how they are related through foreign keys.…

    • 512 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Pt2520 Unit 6

    • 1447 Words
    • 6 Pages

    Data independence, it exists when we were able to change the database structure or characteristics without affecting the…

    • 1447 Words
    • 6 Pages
    Powerful Essays
  • Good Essays

    Defining a(n) primary key in a second table creates a relationship between that table and the table where the primary key was first defined. _________________________…

    • 585 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Unit 1 Assignment

    • 80 Words
    • 1 Page

    In the unit 1 assignment, we defined the relations and keys for a library system. In unit 2 we learned about constraints. For your unit 2 assignment, identify and describe the constraints that would be appropriate for the relations that we have within our library system. Constraints that you should consider may include:…

    • 80 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    Information Systems

    • 386 Words
    • 2 Pages

    d) Explain how the two tables are related. Which table contains the foreign key? What is the foreign key?…

    • 386 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Database concepts

    • 586 Words
    • 3 Pages

    In Database Management System, a transitive dependency is a functional dependency which holds by virtue of transitivity. A transitive dependency can occur only in a relation that has three or more attributes. Let A, B, and C designate three distinct attributes (or distinct collections of attributes) in the relation. Suppose all three of the following conditions hold:…

    • 586 Words
    • 3 Pages
    Good Essays

Related Topics