Contents
Chapter 4 · DatabasePractice

LEARN WITH HARU

Video Lesson တွေက Haru အတန်းသားတွေအတွက်ပါ

Haru ရဲ့ ITPEC FE Full Course မှာ ယခု သင်ခန်းစာတွေကို တစ်ခုချင်း တစ်ကြောင်းချင်း အသေးစိတ်ရှင််ရှင်းပြထားပါတယ်

အခြေခံ မရှိတဲ့ ကျောင်းသားများစွာဟာလည်း ဒီ Course နဲ့ ပဲ အောင်မြင်ကုန်ကြပါပြီ

အတန်းမအပ်သေးပဲ Haru ဆီမှာ အစမ်းသင်ကြည့်ချင်ပါသလား?

သင်တန်းသားတွေရဲ့ စကားသံများ

သင်တန်းသားတွေရဲ့ စကားသံများ

Highlighted text? Practice this concept. Highlighted passages and figures open related questions.

Practice related questions (7)Progress & bookmarks

Current section

1-2-4 Logical Design of Databases

p. 252

Practice this section 7 linked exam questions with default filters

Progress

Not marked complete

Related questions in this lesson 8

Original normalization procedure3Transitive functional dependencies1Attributes and keys in table design1Foreign key referential constraint2Functional dependency in relational design1Primary key uniqueness and non-NULL constraints2
Progress and bookmarks

p. 252

1-2-4 Logical Design of Databases

Logical design of databases is the process of creating logical data models in consideration of the databases to be implemented. (Files/records/fields (items) are defined in a structured database, while tables/tuples/attributes are defined in a relational database.)

In the case of a relational database, table design is performed to decide which attributes of the table should be used for managing the data items represented in conceptual design. At that time, primary key and foreign key of each table should also be considered. · 1 question

Original textbook table, example or syntax box, with its complete original layout. Source text: • Primary key It is a field (or a combination of fields) that uniquely identifies each tuple (i.e., record) in a table. (Composite key made of multiple fields is also acceptable.) For primary key, there are constraints, such as non-NULL constraint that does not allow NULL (null value) and unique constraint that does not allow duplication of values in a table. • Foreign key
p. 252 · Enlarge
Primary key uniqueness and non-NULL constraints · 2 practice questions

p. 253

Original textbook table, example or syntax box, with its complete original layout. Source text: It is a field (or a combination of fields) for referencing a tuple (i.e., record) whose values match the primary key of another table. For a foreign key, it is possible to define referential constraint, which requires that the primary key of the table to be referenced must have a tuple (i.e., record) having the same value. Note: Non-NULL constraint, unique constraint, and referential constraint are also called consistency constraint for always maintaining the data in the correct status.
p. 253 · Enlarge
Foreign key referential constraint · 2 practice questions

In a general table design, required fields are listed in a table in the un-normalized form (UNF). Next, data normalization is performed in order to design efficient table. Functional dependency is the property where if a certain attribute is decided, other attributes is uniquely decided. · 1 question

Original textbook table, example or syntax box, with its complete original layout. Source text: [Data normalization procedure] 1) First normalization (Deliverable: Table in the first normal form) Iterative fields or derived fields (i.e., fields determined through calculation) are eliminated. 2) Second normalization (Deliverable: Table in the second normal form) When the primary key is a composite key, fields that are dependent on some of the fields constituting the primary key are split into a separate table. (This dependency is called partial functional dependency.) 3) Third normalization (Deliverable: Table in the third normal form) Fields dependent on the fields other than the primary key are split into a separate table. (This dependency is called transitive functional dependency.)
p. 253 · Enlarge
Original normalization procedure · 3 practice questions

By proceeding up to the third normalization as per the procedure, it is possible to design a table where all fields are dependent on the primary key. (This is called full functional dependency.) However, there are cases where the third normal form is not the best option. (For example, it may be more efficient to retain frequently used derived fields.) Therefore, it is necessary to consider including the operational aspects.

Original textbook table, example or syntax box, with its complete original layout. Source text: Example: Provide the third normal form obtained by normalizing the following table in un-normalized form. Underlined fields are primary keys, and { } indicates repetitive fields. Voucher (VoucherNumber, Date, CustomerNumber, CustomerName, TotalAmount, {ProductNumber, ProductName, UnitPrice, Quantity, Amount}) 1) First normalization: Eliminate repetitive fields (ProductNumber,
p. 253 · Enlarge

p. 254

Original textbook table, example or syntax box, with its complete original layout. Source text: ProductName, UnitPrice, Quantity, Amount) and derived fields (TotalAmount, Amount) Voucher (VoucherNumber, Date, CustomerNumber, CustomerName, ProductNumber, ProductName, UnitPrice, Quantity) 2) Second normalization: Split partial functional dependency ({Date, CustomerNumber, CustomerName} dependent on VoucherNumber, {ProductName, UnitPrice} dependent on ProductNumber) Voucher (VoucherNumber, Date, CustomerNumber, CustomerName) Details (VoucherNumber, ProductNumber, Quantity) Product (ProductNumber, ProductName, UnitPrice) 3) Third normalization: Split transitive functional dependency (CustomerName dependent on CustomerNumber) Voucher (VoucherNumber, Date, CustomerNumber) Details (VoucherNumber, ProductNumber, Quantity) Product (ProductNumber, ProductName, UnitPrice) Customer (CustomerNumber, CustomerName)
p. 254 · Enlarge
Transitive functional dependencies · 1 practice questions

Original chapter exercises

Original chapter exercises →

New FE Textbook Vol.1 · IT Fundamentals · First Edition, April 2015