Database System Concepts"Database System Concepts, 5/e", is intended for a first course in databases at the junior or senior undergraduate, or first-year graduate, level. In addition to basic material for a first course, the text contains advanced material that can be used for course supplements, or as introductory material for an advanced course. The authors assume only a familiarity with basic data structures, computer organization, and a high-level programming language such as Java, C, or Pascal. Concepts are presented as intuitive descriptions, and many are based on the running example of a bank enterprise. Important theoretical results are covered, but formal proofs are omitted. In place of proofs, figures and examples are used to suggest why a result is true. The fundamental concepts and algorithms covered in the book are often based on those used in existing commercial or experimental database systems. The aim is to present these concepts and algorithms in a general setting that is not tied to one particular database system. Details of particular commercial database systems are discussed in the case studies which constitute Part 8 of the book. prior editions while evolving the content and organization to reflect the changes that are occurring in the way databases are designed, managed, and used. |
From inside the book
Results 1-3 of 42
Page 276
... normal form , weaker than BCNF , that will allow us to preserve de- pendencies . That normal form is called third normal form.2 7.3.4 Third Normal Form BCNF requires that all nontrivial dependencies be of the form a → B , where a is a ...
... normal form , weaker than BCNF , that will allow us to preserve de- pendencies . That normal form is called third normal form.2 7.3.4 Third Normal Form BCNF requires that all nontrivial dependencies be of the form a → B , where a is a ...
Page 298
... that they are not only hard to reason with , but there is also no set of sound and complete inference rules for reasoning about the constraints . Hence PJNF and 298 Chapter 7 Relational Database Design More Normal Forms.
... that they are not only hard to reason with , but there is also no set of sound and complete inference rules for reasoning about the constraints . Hence PJNF and 298 Chapter 7 Relational Database Design More Normal Forms.
Page 305
... normal form . • We introduced the concept of functional dependencies , and used it to present two normal forms , Boyce - Codd normal form ( BCNF ) and third normal form ( 3NF ) . • If the decomposition is dependency preserving , given a ...
... normal form . • We introduced the concept of functional dependencies , and used it to present two normal forms , Boyce - Codd normal form ( BCNF ) and third normal form ( 3NF ) . • If the decomposition is dependency preserving , given a ...
Other editions - View all
Common terms and phrases
account number account_number aggregate algorithm allows amount B+-tree balance bank BCNF block borrower branch_name bucket candidate key Chapter clause compute consider constraints contains customer_id customer_street data model database design database schema database system Datalog decomposition defined delete depositor disk domain domain relational calculus E-R diagram employee employee_id employee_name encryption entity set example executed Figure foreign key functional dependencies hash identifier implement insert interface Java JDBC Jones loan_number lower-level entity sets manager multiset multivalued dependencies node normal form null values object object-oriented operation outer join Perryridge branch pointers primary key programming language query language r₁ records recursive relation schema relational algebra relational calculus relational database relationship set result rule search-key value Section server servlet specify statement storage stored structure subquery superkey tion trigger tuple relational calculus tuples update variable view relation weak entity weak entity set write