Kinh doanh - Marketing
Kinh tế quản lý
Biểu mẫu - Văn bản
Tài chính - Ngân hàng
Công nghệ thông tin
Tiếng anh ngoại ngữ
Kĩ thuật công nghệ
Khoa học tự nhiên
Khoa học xã hội
Văn hóa nghệ thuật
Sức khỏe - Y tế
Văn bản luật
Nông Lâm Ngư
Kỹ năng mềm
Luận văn - Báo cáo
Giải trí - Thư giãn
Tài liệu phổ thông
Văn mẫu
Giới thiệu
Đăng ký
Đăng nhập
Tìm
Danh mục
Kinh doanh - Marketing
Kinh tế quản lý
Biểu mẫu - Văn bản
Tài chính - Ngân hàng
Công nghệ thông tin
Tiếng anh ngoại ngữ
Kĩ thuật công nghệ
Khoa học tự nhiên
Khoa học xã hội
Văn hóa nghệ thuật
Y tế sức khỏe
Văn bản luật
Nông lâm ngư
Kĩ năng mềm
Luận văn - Báo cáo
Giải trí - Thư giãn
Tài liệu phổ thông
Văn mẫu
Thông tin
Điều khoản sử dụng
Quy định bảo mật
Quy chế hoạt động
Chính sách bản quyền
Giới thiệu
Đăng ký
Đăng nhập
0
Trang chủ
Công Nghệ Thông Tin
Cơ sở dữ liệu
Relational Database Design Algorithms and Further Dependencies
Đang chuẩn bị liên kết để tải về tài liệu:
Relational Database Design Algorithms and Further Dependencies
Lương Quyền
73
66
ppt
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Relation Decomposition and Insufficiency of Normal Forms (cont.): Attribute preservation condition: Each attribute in R will appear in at least one relation schema Ri in the decomposition so that no attributes are “lost”. Another goal of decomposition is to have each individual relation Ri in the decomposition D be in BCNF or 3NF. Additional properties of decomposition are needed to prevent from generating spurious tuples | Relational Database Design Algorithms and Further Dependencies Chapter Outline 0. Designing a Set of Relations 1. Properties of Relational Decompositions 2. Algorithms for Relational Database Schema 3. Multivalued Dependencies and Fourth Normal Form 4. Join Dependencies and Fifth Normal Form 5. Inclusion Dependencies 6. Other Dependencies and Normal Forms DESIGNING A SET OF RELATIONS (1) The Approach of Relational Synthesis (Bottom-up Design) : Assumes that all possible functional dependencies are known. First constructs a minimal set of FDs Then applies algorithms that construct a target set of 3NF or BCNF relations. Additional criteria may be needed to ensure the the set of relations in a relational database are satisfactory (see Algorithms 11.2 and 11.4). DESIGNING A SET OF RELATIONS (2) Goals: Lossless join property (a must) – algorithm 11.1 tests for general losslessness. Dependency preservation property – algorithms 11.3 decomposes a relation into BCNF components by sacrificing the dependency preservation. Additional normal forms 4NF (based on multi-valued dependencies) 5NF (based on join dependencies) 1. Properties of Relational Decompositions (1) Relation Decomposition and Insufficiency of Normal Forms: Universal Relation Schema: a relation schema R={A1, A2, , An} that includes all the attributes of the database. Universal relation assumption: every attribute name is unique. Decomposition: The process of decomposing the universal relation schema R into a set of relation schemas D = {R1,R2, , Rm} that will become the relational database schema by using the functional dependencies. Properties of Relational Decompositions (2) Relation Decomposition and Insufficiency of Normal Forms (cont.): Attribute preservation condition: Each attribute in R will appear in at least one relation schema Ri in the decomposition so that no attributes are “lost”. Another goal of decomposition is to have each individual relation Ri in the decomposition D be in BCNF or 3NF. . | Relational Database Design Algorithms and Further Dependencies Chapter Outline 0. Designing a Set of Relations 1. Properties of Relational Decompositions 2. Algorithms for Relational Database Schema 3. Multivalued Dependencies and Fourth Normal Form 4. Join Dependencies and Fifth Normal Form 5. Inclusion Dependencies 6. Other Dependencies and Normal Forms DESIGNING A SET OF RELATIONS (1) The Approach of Relational Synthesis (Bottom-up Design) : Assumes that all possible functional dependencies are known. First constructs a minimal set of FDs Then applies algorithms that construct a target set of 3NF or BCNF relations. Additional criteria may be needed to ensure the the set of relations in a relational database are satisfactory (see Algorithms 11.2 and 11.4). DESIGNING A SET OF RELATIONS (2) Goals: Lossless join property (a must) – algorithm 11.1 tests for general losslessness. Dependency preservation property – algorithms 11.3 decomposes a relation into BCNF components by .
TÀI LIỆU LIÊN QUAN
Lecture Database - Chapter 7: Relational database design by ER and EER-to-Relational mapping
Lecture Fundamentals of Database Systems - Chapter 7: Relational database design by ER-and EERR-to-Relational mapping
Database Systems: Lecture 11 - Practical Database Design and Tuning
Lecture Fundamentals of Database Systems - Chapter 11: Relational database design algorithms and further dependencies
Lecture Database management systems - Chapter 5: Relational database design by ER and EER-to-relational mapping
Lecture Database Systems - Chapter 4: Relational data model and ER/EER-to-Relational mapping (Trương Quỳnh Chi)
Lecture Database design, application development and administration - Chapter 3: The relational data model
Lecture Database System: Chapter 6 - Relational Database Design by ER- and EERR-to-Relational Mapping
Lecture Database System: Chapter 6 - Relational Database Design by ER- and EERR-to-Relational Mapping
Lecture Database design, application development and administration - Chapter 7: Normalization of relational tables
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.