BUSI 3400 Chapter Notes - Chapter 3: Relational Algebra, Superkey, Candidate Key

26 views2 pages

Document Summary

Relational database model: enables logical representation of the data and its relationships (based on logical construct called a relation) Attribute domain: specific range of values for attributes. Keys help: ensure table row is uniquely identifiable, establish relationships among tables and to data integrity. Determination: state in which knowing the value of one attribute makes it possible to determine the value of another. Functional dependence: value of one or more attributes determines the value of one or more other attributes. Dependent: attribute whose value is determined by the other attribute. Full functional dependence: minimum number of attributes is used as the determinant. Composite key: key that is composed of more than one attribute. Key attribute: attribute that is a part of a key. Entity integrity: condition in which each row in the table has its own unique identity (pk is unique and not null)

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents