![Phân tích tư tưởng của nhân dân qua đoạn thơ: Những người vợ nhớ chồng… Những cuộc đời đã hóa sông núi ta trong Đất nước của Nguyễn Khoa Điềm](https://timtailieu.net/upload/document/136415/phan-tich-tu-tuong-cua-nhan-dan-qua-doan-tho-039-039-nhung-nguoi-vo-nho-chong-nhung-cuoc-doi-da-hoa-song-nui-ta-039-039-trong-dat-nuoc-cua-nguyen-khoa-136415.jpg)
Phụ thuốc hàm và phụ thuộc đa trị trong cơ sở dữ liệu quan hệ mờ.
Số trang: 7
Loại file: pdf
Dung lượng: 3.78 MB
Lượt xem: 14
Lượt tải: 0
Xem trước 2 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Phụ thuốc hàm và phụ thuộc đa trị trong cơ sở dữ liệu quan hệ mờ. Triển khai trình diễn mô hình công nghệ tiên tiến xử lý nguồn nước nhiễm phèn, Mn, độc tố, cứng, vi sinh cao ... thành nước đạt tiêu chuẩn Việt Nam (TCVN) phục vụ việc cung cấp nước sạch và nước tinh khiết cho sinh hoạt ăn uống và mục đích y tế tại những vùng khó khăn về nguồn nước sạch, nhằm nâng cao điều kiện kỹ thuật y tế cho nhân dân và bệnh viện Lao và bệnh phổi Tây Ninh, phục...
Nội dung trích xuất từ tài liệu:
Phụ thuốc hàm và phụ thuộc đa trị trong cơ sở dữ liệu quan hệ mờ. T,!-p chi Tin hoc va Dieu khien hoc, T.17, S.2 (2001),13-19ON FUNCTIONAL DEPENDENCIES AND MULTIVALUED DEPENDENCIES IN FUZZY RELATIONAL DATABASES HO THUAN, TRAN THIEN THANHAbstract. In this paper, we present a new definition of fuzzy functional depencency and fuzzy multival-ued dependency based on similarity in fuzzy relational database, for which thresholds are defined for eachattributes of relation scheme. The soundness and completeness of inference rules, similar to Armstrongsaxioms are proved.Tom tlit. Trong bai bao nay chiing tai trlnh bay dinh nghia cho phu shuoc ham va phu thuoc da tr] me)tren me hlnh CO so dir li~u mo dua tren quan h~ t uong tv voi nguong t uong tv xac dinh rieng cho m6ithucc tinh. Tinh xac ding va day dii cila h~ tien de t uong tv h~ t ien de Armstrong ciing dtroc chung minh. 1. INTRODUCTION Relational databases have been studied since Codds. Such databases can only deal with well-defined and unambiguous data. But in the real world there exist data which cannot be well-definedin a certain clear sense and under a certain crisp form (often called fuzzy data). The databases forthe above mentioned data have been investigated by different authors (see [7)). The fuzzy databasemodels are an extension of the classical relational model. It is based on the fuzzy set theory inventedby Zadeh to capture the imprecise parts of the real world. In genegal, two approaches have been proposed for the introduction of fuzziness in the relationalmodel. The first one uses the principle of replacing the ordinary equivalence among domain valuesby measures of nearness such as similarity relationships, proximity relationship, and distinguishabilityJunction (see [8)). The second major effort has involved a variety of approaches that directly use pos-sibility distributions for attribute value (see [5)). There have also been some mixed models combiningthese approaches [121. This paper takes the similarity-based fuzzy relational databases as the reference model in ourstudy presented here. The data dependencies are the most important topics in theory of relational databases. Severalauthors have proposed extended dependencies in fuzzy relational database models. In [1,2,4,6,10,121have been given definitions of fuzzy functional dependencies and fuzzy multivalued dependencies infuzzy relational data models. These dependencies are extension of dependencies of classical relationalmodel. In this article, we give the definitions of fuzzy functional dependency (abbr. (a, t1)-ffd) andfuzzy multivalued dependency (abbr. (a, ,B)-fmvd). These dependencies are extention of dependenciesin classical model and more general than definitions of Rauj, Mazumdar, etc. We also show that theinference rules of (a, ,B)-ffd, (a, ,B)-fmvd, which are similar to Armstrong axioms for classical relationaldatabases, are sound and complete. This paper is organized as follows. Section 2 present some basic definitions of the similarity- based relational databases. In Section 3 and Section 4, we introduce an extension of functional and multivalued dependencies; Armstrongs axioms for fuzzy functional and multivalued dependencies are presented; the soundness and completeness are proved. Section 5 concludes this paper with some perspectives of the present work. 2. SIMILARITY-BASED FUZZY RELATIONAL DATABASES The similarity-based fuzzy relational database model is a generalization of the original relationalmodel. It is allowed an attribute value to be a subset of the associated domain. Domains for thismodel are either discrete scalars or discrete numbers drawn from either a finite or infinite set. The14 HO THUAN, TRAN THIEN THANHequivalence relation over the domain is replaced by a fuzzy similarity relation to identify similartuples exceeding a given threshold of similarity.Definition 2.1. A similarity relation is a mapping s : D x D --+ 10,1] such that for x, y, zED, s(x, x) = 1 (reflexivity), s(x, y) = s(y, x) (symmetry), s(x, z) 2 maxyED{minls(x, y), s(y, z)]} (max-min transitivity).Deftnit ion 2.2. A fuzzy relation scheme is a triple S = (R, s, 5), where R = {AI, A2 An} is aset of attributes, s = (s 1, s2, ... , sn) is a set of associated similarity relations, 5 = (a 1, a2, ... , an) isa set of associated thresholds (ai E 10,1], 1:::; i :::; n).Definition 2.3. A fuzzy relationinstance r on scheme S = ( ...
Nội dung trích xuất từ tài liệu:
Phụ thuốc hàm và phụ thuộc đa trị trong cơ sở dữ liệu quan hệ mờ. T,!-p chi Tin hoc va Dieu khien hoc, T.17, S.2 (2001),13-19ON FUNCTIONAL DEPENDENCIES AND MULTIVALUED DEPENDENCIES IN FUZZY RELATIONAL DATABASES HO THUAN, TRAN THIEN THANHAbstract. In this paper, we present a new definition of fuzzy functional depencency and fuzzy multival-ued dependency based on similarity in fuzzy relational database, for which thresholds are defined for eachattributes of relation scheme. The soundness and completeness of inference rules, similar to Armstrongsaxioms are proved.Tom tlit. Trong bai bao nay chiing tai trlnh bay dinh nghia cho phu shuoc ham va phu thuoc da tr] me)tren me hlnh CO so dir li~u mo dua tren quan h~ t uong tv voi nguong t uong tv xac dinh rieng cho m6ithucc tinh. Tinh xac ding va day dii cila h~ tien de t uong tv h~ t ien de Armstrong ciing dtroc chung minh. 1. INTRODUCTION Relational databases have been studied since Codds. Such databases can only deal with well-defined and unambiguous data. But in the real world there exist data which cannot be well-definedin a certain clear sense and under a certain crisp form (often called fuzzy data). The databases forthe above mentioned data have been investigated by different authors (see [7)). The fuzzy databasemodels are an extension of the classical relational model. It is based on the fuzzy set theory inventedby Zadeh to capture the imprecise parts of the real world. In genegal, two approaches have been proposed for the introduction of fuzziness in the relationalmodel. The first one uses the principle of replacing the ordinary equivalence among domain valuesby measures of nearness such as similarity relationships, proximity relationship, and distinguishabilityJunction (see [8)). The second major effort has involved a variety of approaches that directly use pos-sibility distributions for attribute value (see [5)). There have also been some mixed models combiningthese approaches [121. This paper takes the similarity-based fuzzy relational databases as the reference model in ourstudy presented here. The data dependencies are the most important topics in theory of relational databases. Severalauthors have proposed extended dependencies in fuzzy relational database models. In [1,2,4,6,10,121have been given definitions of fuzzy functional dependencies and fuzzy multivalued dependencies infuzzy relational data models. These dependencies are extension of dependencies of classical relationalmodel. In this article, we give the definitions of fuzzy functional dependency (abbr. (a, t1)-ffd) andfuzzy multivalued dependency (abbr. (a, ,B)-fmvd). These dependencies are extention of dependenciesin classical model and more general than definitions of Rauj, Mazumdar, etc. We also show that theinference rules of (a, ,B)-ffd, (a, ,B)-fmvd, which are similar to Armstrong axioms for classical relationaldatabases, are sound and complete. This paper is organized as follows. Section 2 present some basic definitions of the similarity- based relational databases. In Section 3 and Section 4, we introduce an extension of functional and multivalued dependencies; Armstrongs axioms for fuzzy functional and multivalued dependencies are presented; the soundness and completeness are proved. Section 5 concludes this paper with some perspectives of the present work. 2. SIMILARITY-BASED FUZZY RELATIONAL DATABASES The similarity-based fuzzy relational database model is a generalization of the original relationalmodel. It is allowed an attribute value to be a subset of the associated domain. Domains for thismodel are either discrete scalars or discrete numbers drawn from either a finite or infinite set. The14 HO THUAN, TRAN THIEN THANHequivalence relation over the domain is replaced by a fuzzy similarity relation to identify similartuples exceeding a given threshold of similarity.Definition 2.1. A similarity relation is a mapping s : D x D --+ 10,1] such that for x, y, zED, s(x, x) = 1 (reflexivity), s(x, y) = s(y, x) (symmetry), s(x, z) 2 maxyED{minls(x, y), s(y, z)]} (max-min transitivity).Deftnit ion 2.2. A fuzzy relation scheme is a triple S = (R, s, 5), where R = {AI, A2 An} is aset of attributes, s = (s 1, s2, ... , sn) is a set of associated similarity relations, 5 = (a 1, a2, ... , an) isa set of associated thresholds (ai E 10,1], 1:::; i :::; n).Definition 2.3. A fuzzy relationinstance r on scheme S = ( ...
Tìm kiếm theo từ khóa liên quan:
toán tử tuyến tính. điều khiển học nghiên cứu tin học Lý thuyết thuật toán tự động học khoa học điều khiểnTài liệu liên quan:
-
Tóm tắt về giảm bậc cho các mô hình: một giải pháp mang tính bình phẩm.
14 trang 470 0 0 -
Nghiên cứu thuật toán lý thuyết: Phần 2
61 trang 144 0 0 -
Nghiên cứu thuật toán lý thuyết: Phần 1
47 trang 121 0 0 -
Nghiên cứu lý thuyết thuật toán: Phần 2
35 trang 39 0 0 -
Nghiên cứu lý thuyết thuật toán: Phần 1
73 trang 38 0 0 -
Thuật toán bầy ong giải bài toán cây khung với chi phí định tuyến nhỏ nhất
12 trang 35 0 0 -
Bài giảng Hệ thống điều khiển thông minh: Chương 5 - TS. Huỳnh Thái Hoàng
61 trang 34 0 0 -
Cực tiểu hóa thời gian trễ trung bình trong một mạng hàng đợi bằng giải thuật di truyền.
6 trang 32 0 0 -
Phân tích tính hội tụ của thuật toán di truyền lai mới
8 trang 32 0 0 -
Mô hình cơ sở dữ liệu hướng đối tượng mờ dựa trên ngữ nghĩa địa số gia tử
13 trang 31 0 0