Reasoning about Fuzzy Functional Dependencies
|
|
- Curtis Harmon
- 8 years ago
- Views:
Transcription
1 Reasoning about Fuzzy Functional Dependencies Pablo Cordero Angel Mora Manuel Enciso Gabriel Aguilera I.P. de Guzmán E.T.S.I. Informática. Universidad de Málaga. Abstract In literature, there exists several logics to specify and manipulate functional dependencies (FDs) and fuzzy FDs (FFDs). Nevertheless, their inference systems are suitable to illustrate FD and FFD semantics but they may not be used as a formal base to develop automated deduction methods. In this work, we use the correct and complete axiomatic system S e, with a new FFD inference rule, named Substitution Rule. This rule allows us to introduce the Deduction Theorem for FFD and is the key for solving the FFD implication problem. Keywords: fuzzy functional dependencies, logic, implication problem. 1 Introduction Constraints are often used to guide the design of noteworthy relational schema for the sake of the database consistence and therefore to avoid the problems of redundances, anomalies,etc. This statement is valid for any extension of the classical relational model. During three consecutive decades, Raju and Majumdar [19], Cubero and Vila [6], Tyagi et.al. [23],etc. have studied the fuzzy models and which constraints are more appropriated to extend the well studied relational database theory to their fuzzy database. Several approaches to the definition of fuzzy functional dependency [6, 18, 19, 22, 23] (FFD) are proposed in the literature. In the same way as the concept of functional dependency (FD) correspond to the notion of partial function, it should be desired that the concept Partially supported by Spanish DGI project TIN and Junta de Andalucia project TIC115. of FFD would correspond to the notion of fuzzy partial function. The definitions proposed in [19, 22, 23] fit in this idea. There exists a wide range of dependencies. Some of them were investigated in the past (FDs [4, 9], Multivalued Dependencies [10], etc.) and others are still being studied today ( XML FDs [13], FFDs [22], etc.). Moreover, each dependency definition is usually followed by its corresponding logic. In [19, 23] the authors propose Armstrong s axioms as a useful tool for reasoning with FFD, but these inferences rule has not been used successfully in automated deduction. The reason is that this inference system were created to explain dependency semantics more than to design an automated deduction system. In fact, in [23] the authors propose the classical closure algorithm to solve the implication problem and don t directly use Armstrong s axioms. In [5] a novel logic (SL) equivalent to classical Armstrong s axioms was presented. The core of SL is the Substitution Rule 1. The definition of SL introduces, for the first time, interesting solutions to database problems, which are solved using logic-based automated deduction methods [1, 15, 16]. In this work, we illustrate how the Substitution Rule can be considered to reasoning with FFDs. First, we extend the language of FFD Logic to allow empty left hand side formulae and we use this new well formed formulae as goals to be satisfied in a given FFD theory. The substitution rule is used to build a novel substitution algorithm directly based on the inference system. We emphasize that we solve the implication problem for FFDs reducing the set of FFDs with the substitution rule. This work opens the door to the management of FFD constraints in an efficient and intelligent way and is organized as follows: Section 2 introduces some defi- 1 The primitive inference system doesn t contain the transitivity rule and is a rule derived in SL (see [5]). XIV Congreso Español sobre Tecnologías y Lógica fuzzy 121
2 nitions of FFDs. In section 3 we show how previous FD logics reason about FFDs and the limitations of these logics to manipulate automatically a set of FFDs. We introduce the problem that we solve in this paper, named the FFD implication problem. In section 4 we propose a new automated deduction method to solve the FFD implication problem and finally we establish several conclusions and future works in section 5. 2 Fuzzy Functional Dependencies Since the 80 s, some authors have extended the Relational Model to include imprecise/fuzzy information [6, 18, 19, 23]. A fuzzy extension of the Codd Relational Model also require to consider an extension of the integrity constraints that may involve fuzzy concepts. In classical relational databases the study of the integrity constraints have been developed successfully in the past. The FD is considered the first step of this studies, since the definition of FD play an outstanding role in the Relational Model. The FD is very close to the notion of key and it is used in other areas like knowledge discovery, query optimization, database design, etc. The classical FDs specify an association between the values of the attributes of a relation which allows to include, in a formal way, constraints like the following: if two employees have the same qualification then they have the same salary. As J. Paredaens et al. say in [17]: they are constraint in the description of a database in order to ensure that the instances we might obtain are meaningful. Thus, if the Functional Dependency X Y holds in a relation R, where X, Y are subset of attributes, then for any instance of R if two tuples agree on X, then they also agree on Y. When a fuzzy extension of the notion of FD are introduced, some authors consider that the data becomes fuzzy while others consider that the dependency may be imprecise. In [19] the author introduces a definition of FFD to model fuzzy information such as employees with similar experience must have similar salaries, which may be consider a precise dependency, while in [22] they propose a FFD which allows to model expressions such as the intelligence level of a person more or less determines the degree of success. Each definition of FFD treats a particular aspect of the fuzziness. We emphasize the definition of [19] because the introduction of an operator (a fuzzy resemblance measure EQ for comparing domain values) made possible a generalization of the FDs and to the their definition of FFDs: A FFD X Y holds in a fuzzy relation r, if for all tuples t 1 and t 2 of r, we have that µ EQ (t 1 [X], t 2 [X]) µ EQ (t 1 [Y ], t 2 [Y ]) where µ is the membership function of the fuzzy relation 2. A great variety of FFD definitions can be found in the literature. In [23] the authors summarize some of them and study the fuzziness and imprecision degree, both in the data and in the dependency of the FFD definitions. This study shows a definition [22] which has a high degree of fuzziness and it is a natural extension of the classical FD concept: X Θ F Y, holds in a fuzzy relation if, for every pair of tuples t 1 and t 2 then Conf((t 1, t 2 )[X]) min(θ, Conf((t1, t2)[y ]), Θ [0, 1]. If Θ = 0, there is no valid dependency and if Θ = 1 then imprecise FFD become precise FFD; otherwise, imprecise FFDs exist. Here Conf(t 1, t 2 )[X] is the degree of closeness between two tuples t 1 and t 2 projected over attributes X in a fuzzy relation instance and is called the conformance. When Θ = 1 then, the definition of [22] generalizes the one presented in [19]. In this work, we deal with this second definition. An extension of our study to consider more general definitions will be made in a future work. 3 Reasoning about FFDs Several axiomatic systems has been published [9, 17] that are equivalent to Amstrong s axiomatic system. These logics may be considered as formal tools to formally explain how to deduce a dependency from a given set of dependencies. However, in [11, 12], the authors state the limitations to manage dependencies using logic, and they claim for efficient automatic computation methods. On the other hand, in [12, 14, 20], indirect methods for the manipulation of dependencies are used as an alternative. Specifically, we are interested in solving the implication problem by using directly the logic. Unfortunately, all the classical axiomatic systems are not suitable tools to develop automated deduction techniques, because all of them are based on the transitive rule. Instead of that, in literature, there are several algorithms to solve the implication problem in polynomial time (see [3, 7] for further details). Nevertheless, these efficient methods have a very important disadvantage: they do not allow to give an explanation about the answer. When we use an indirect method we are not 2 µ denotes the more o less equal relation. 122 XIV Congreso Español sobre Tecnologías y Lógica fuzzy
3 able to translate the final solution into an inference chain to explain the answer in terms of the inference system. This limits the use of these indirect methods in artificial intelligence environments. In [5] we introduce a new logic SL equivalent to the classical logics (its axiomatic system is equivalent to the Armstrong s system), but with an important difference: the transitive rule has been replaced by a novel rule. This is the unique axiomatic system in the literature that have not the transitive rule as primitive rule. The novel rule named substitution rule was introduced with the idea to remove redundancy in sets of dependencies. This characteristic make this logic suitable to be used for directly reasoning. Other interesting characteristic of this rule is that can be considered as a transformation of equivalence [15]. In [15] we proved that SL axiomatic system is equivalent to other well known axiomatic systems [3, 9, 12, 17] and thus, all Paredaens derived rules are derived rules in SL. To solve the implication problem we present an extension of SL logic that we will name SL e logic. This basically consists in to extend the language of FFD Logic to allow empty left hand side formulae: Definition 3.1 The SL e logic is the pair (L e, S) where L e = {X Y X, Y 2 Ω } and Ω is a set of attributes. The axiomatic system S consists in: Axiom scheme: if Y X then S X Y Fragmentation rule: if Y Y then Composition rule: X Y S X Y X Y, U V S XU Y V Substitution rule: if X U and X Y = then X Y, U V S (U-Y ) (V -Y ) From now on, to use the standard notation used by database community, will denote the empty set of attributes and XY the union of attributes. The following theorem ensures the correctness and completeness of the method presented in the next section. Theorem 3.2 (Deduction Theorem for FFD) 3 Given Γ L, we have the following equivalence: 3 See the proof of this theorem in [8]. 1. For all X, U, V 2 Ω, Γ { X} S e U V iff Γ S UX V And, in particular: 2. For all X, Y 2 Ω. the following equivalence is stated: Γ { X} S e Y iff Γ S X Y 4 A new automated deduction method Now we are interested in the benefits of the extension that we have just consider. In this section, a novel technique for applying in a systematic way the system SL e is introduced. With this aim, three rewriting rules of simplification are defined using the symbol where Γ Γ means that all the elements in Γ must be replaced by all the elements in Γ. Definition 4.1 Given X, U, V 2 Ω. SC Simplification: If U X then { X, U V } { XV } SA Simplification: If V X then { X, U V } { X} S Simplification: X V X} { X, U V } { X, U Lemma 4.2 Let Γ and Γ be two sets of FFDs. If Γ is obtained from Γ applying the rewriting rules of simplification introduced in definition 4.1 then Proof. SC Simplification: Γ S e Γ { X, U V } 1 S e { X, U X V X} 2 S e { XV } Substitution rule is applied in 1 and, since U X, Composition rule is applied in 2. SA Simplification: { X, U V } 3 S e { X, U X V X} 4 S e { X} Substitution rule is applied in 3 and, since V X, the Axiom is applied in 4. XIV Congreso Español sobre Tecnologías y Lógica fuzzy 123
4 X Simp.Rule ad c b e be cg bc g c a cd b cf bh cg af bd S ad c b e be cg bc g c a cd b cf bh cg af bd SC a c b e be cg bc g c a cd b cf bh cg af bde SC a c be cg bc g c a cd b cf bh cg af bcdeg SA a c bc g c a cd b cf bh cg af bcdeg SC a c c a cd b cf bh cg af abcdeg SA a c cd b cf bh cg af abcdeg S a c cf bh cg af abcdeg SC a c f h cg af abcdefg SA a c f h abcdefg SC f h abcdefgh Figure 1: Table of the example 1 S Simplification: { X, U V } 5 S e { X, U X V X} Substitution rule is applied in 5. Theorem 4.3 Given Γ L and X Y L. If Γ is obtained from Γ { X} applying the rewriting rules of simplification introduced in definition 4.1 while these rules can be applied then there exists a unique Z Γ with X Z and Γ S X Y if and only if Y Z Proof. Firstly, there exist Z Γ with X Z because we apply the rewriting rules to Γ { X} and, when these rules modify X, X increases. The uniqueness of Z is ensured by SC rule. Y Z implies Γ S X Y is obtained using Theorem 3.2, Lemma 4.2 and the fragmentation rule. Conversely, the following steps prove that Γ S X Y implies that Y Z. Let Γ be Γ { Z}: 1. Since Z is unique, Γ L. 2. If Γ S X Y then Theorem 3.2 ensures that Γ S e Y and, from Γ = { Z} Γ, (1) and Theorem 3.2, Γ S Z Y is obtained. 3. If U V Γ then U Z = and V Z =, since otherwise S rule of simplification could be applied. 4. If Γ S Z Y then Y Z because, due to (3), Z Y must be an axiom. The above theorem states the method to determinate if Γ S X Y. The solution arose from adding the goal X to Γ, rendering an initial Γ. Then, rewriting rules of simplification are applied to Γ obtaining { Z} Γ. Finally, Γ S X Y if and only if Y Z. Below, we solve the implication problem using our new methodology: Example 4.1 Let Γ = {ad c, b eh, be c, bc d, c a, cd b, ce af, cf bdh} be this set of FFDs. In order to know whether Γ bd ah, firstly we initialize Γ = Γ { bd} rendering: Γ = { bd, ad c, b eh, be c, bc d, c a, cd b, ce af, cf bdh} The table in figure 1 shows step by step how the rewriting rules of simplification are applied. Note that the underscore points the FFD that is being reduced. The second column shows the applied rule: Since ah abcdefgh and by Theorem 4.3, the following deduction is obtained: Γ = bd ah A novel algorithm for solving the implication problem using rules of simplification defined below is shown in figure 2. The algorithm simply adds X and, in an exhaustive way applies the rules of simplification based on the theoretical study (Theorem 3.2). 124 XIV Congreso Español sobre Tecnologías y Lógica fuzzy
5 { Y es, if Y Closure(X, nil, Γ, 1); Implies?(Γ, X Y )= N o, otherwise. { X, if Γ2 = nil or b = 0; Closure(X, Γ 1, Γ 2, b)= Closure(Simplify(X, Γ 1, Γ 2, 0)), otherwise. Simplify(X, Γ 1, nil, b) = (X, nil, Γ 1, b) Simplify(X, Γ 1, U V :: Γ 2, b) = Simplify(X, Γ 1, Γ 2, b), if V X; = Simplify(XV, Γ 1, Γ 2, 1), if U X and V X; Simplify(X, U-X V -X :: Γ 1, Γ 2, b), otherwise. Figure 2: Algorithm to solve implication problem Since every step adds at least one attribute, in the worst case, the Closure loop is repeated at most A times. The Simplify loop is repeated at most Γ times. Consequently, the complexity of the algorithm is O( A Γ ). We emphasize the following characteristics of the algorithm : The algorithm has the same complexity as the previous algorithms [7, 17] cited in literature, namely linear with regard to the input. Contrary to these previous algorithms, our algorithm has a solid base, since it uses the SL logic. Consequently proofs and explanations are given automatically by the algorithm applying directly the logic SL. Namely, the trace shown in column Simp.Rule reflects the rules of simplification based on SL logic that must be applied in order to prove the implication and the order in which the rules need to be applied. 5 Conclusions and future work We have illustrated the difficulties of directly using other previous logics for dependencies to face up to the implication problem. We have shown how Substitution rules allow the development of automatic deduction methods. None of the classical logics for dependencies can solve the implication problem efficiently without using indirect methods. The algorithm we have proposed in this paper has the same complexity as typical indirect methods but using directly FFD SL. Thus, we can reason and we may built explanations. So, this new algorithm is more appropriate to be used in an artificial intelligence environment. The most efficient algorithms that solve the implication problem were based on complex indirect techniques instead of using theoretical advantages. The use of these indirect techniques obscures the nature of the method. On the contrary, the structure of our algorithm is notably simple. In a future work, we will use SL to solve some interesting problems in the fuzzy databases, like removing redundancy, normalization, canonical closure, etc. We will also study the extension of the technique we have shown in this work to more general definitions of FFDs, for example considering fuzziness not only in the data but in the dependency itself [22]. References [1] Gabriel Aguilera, Pablo Cordero, Manuel Enciso, Angel Mora, and Inmaculada P. de Guzmán. A non-explosive treatment of functional dependencies using rewriting logic. Lecture Notes in Artificial Intelligence, 3171: 31 40, [2] William W. Armstrong. Dependency structures of data base relationships. Proc. IFIP Congress. North Holland, Amsterdam, pages , [3] Paolo Atzeni and Valeria De Antonellis. Relational Database Theory. The Benjamin/Cummings Publishing Company Inc., [4] Edgar F. Codd. Recent investigations into relational data base systems. IFIP Congress, Estocolmo, Suecia, XIV Congreso Español sobre Tecnologías y Lógica fuzzy 125
6 [5] Pablo Cordero, Manuel Enciso, Inmaculada P. de Guzmán, and Angel Mora. Slfd logic: Elimination of data redundancy in knowledge representation. Lecture Notes in Artificial Intelligence 2527, Springer-Verlag, pages , [6] J.C. Cubero, M.A. Vila. A new definition of fuzzy functional dependency in fuzzy relational databases. Internat. J. Intell. Systems, 9 (5): , [7] Jim Diederich and Jack Milton. New methods and fast algorithms for database normalization. ACM Transactions on Database Systems, 13 (3): , [8] Manuel Enciso, Gabriel Aguilera, Pablo Cordero, Angel Mora, and Inmaculada P. de Guzmán. Logic-based Functional Dependencies Programming. Technical Reports. Departamento de Matemática Aplica. Universidad de Málaga [9] Ronald Fagin. Functional dependencies in a relational database and propositional logic. IBM. Journal of research and development, 21 (6): , [10] Ronald Fagin. Multivalued dependencies and a new normal form for relational databases. ACM TODS 2, [11] J. W. Guan and D. A. Bell. Rough computational methods for information systems. Artificial Intelligence, (2):77 103, [12] Toshihide Ibaraki, Alexander Kogan, and Kazuhisa Makino. Functional dependencies in horn theories. Artificial Intelligence, :1 30, [16] Angel Mora, Gabriel Aguilera, Manuel Enciso, Pablo Cordero, and Inmaculada P. de Guzmán. A new closure algorithm based in logic: SLFD- Closure versus classical closures. Inteligencia Artificial, Revista Iberoamericana de IA, 31 (10): 31 40, 2006 [17] Jan Paredaens, Paul De Bra, Marc Gyssens, and Dirk Van Van Gucht. The structure of the relational database model. EATCS Monographs on Theoretical Computer Science, [18] H. Prade, C. Testemale. Generalizing database realtional algebra for the treatment of incomplete or uncertain information and vague queries. Information Sciences, 34: , [19] H.V.S.V.N. Raju, A.K. Mazumdar. Fuzzy dependencies and losless join descomposition of fuzzy relational database systems. ACM Transaction of Database Systems, 13 (2): , [20] Iztok Savnik and Peter A. Flach. Bottom-up induction of functional dependencies from relations. Proc. of AAAI-93 Workshop: Knowledge Discovery in Databases, pages , [21] E. Sciore. A complete axiomatization of full join dependencies. J. ACM, 29 (2): , [22] Mustafa Ilker Sozat and Adnan Yazici. A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations. Fuzzy Sets and Systems, 117 (2): , [23] B.K. Tyagi, A. Sharfuddin, R.N. Dutta, Devendra K. Tayal. A complete axiomatization of fuzzy functional dependencies using fuzzy function. Fuzzy Set and Systems, 151: , [13] M. L. Lee, T. W. Ling, and W. L. Low. Designing functional dependencies for xml. Lecture Notes in Computer Science, Springer-Verlag, 2287: , [14] Heikki Mannila and Kari-Jouko Raiha. Algorithms for inferring functional dependencies from relations. Data and Knowledge Engineering, 12 (1):83 99, [15] Angel Mora, Manuel Enciso, Pablo Cordero, and Inmaculada P. de Guzmán. The functional dependence implication problem: optimality and minimality. an efficient preprocessing transformation based on the substitution paradigm. Lecture Notes in Artificial Intelligence, Springer-Verlag, 3040, XIV Congreso Español sobre Tecnologías y Lógica fuzzy
Relational Database Design
Relational Database Design To generate a set of relation schemas that allows - to store information without unnecessary redundancy - to retrieve desired information easily Approach - design schema in appropriate
More informationDatabase Design and Normalization
Database Design and Normalization CPS352: Database Systems Simon Miner Gordon College Last Revised: 9/27/12 Agenda Check-in Functional Dependencies (continued) Design Project E-R Diagram Presentations
More informationFunctional Dependencies and Normalization
Functional Dependencies and Normalization 5DV119 Introduction to Database Management Umeå University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner Functional
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationDatabases -Normalization III. (N Spadaccini 2010 and W Liu 2012) Databases - Normalization III 1 / 31
Databases -Normalization III (N Spadaccini 2010 and W Liu 2012) Databases - Normalization III 1 / 31 This lecture This lecture describes 3rd normal form. (N Spadaccini 2010 and W Liu 2012) Databases -
More informationKNOWLEDGE FACTORING USING NORMALIZATION THEORY
KNOWLEDGE FACTORING USING NORMALIZATION THEORY J. VANTHIENEN M. SNOECK Katholieke Universiteit Leuven Department of Applied Economic Sciences Dekenstraat 2, 3000 Leuven (Belgium) tel. (+32) 16 28 58 09
More informationIntegrating Pattern Mining in Relational Databases
Integrating Pattern Mining in Relational Databases Toon Calders, Bart Goethals, and Adriana Prado University of Antwerp, Belgium {toon.calders, bart.goethals, adriana.prado}@ua.ac.be Abstract. Almost a
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationDatabase Design and Normal Forms
Database Design and Normal Forms Database Design coming up with a good schema is very important How do we characterize the goodness of a schema? If two or more alternative schemas are available how do
More informationAdvanced Relational Database Design
APPENDIX B Advanced Relational Database Design In this appendix we cover advanced topics in relational database design. We first present the theory of multivalued dependencies, including a set of sound
More informationAn Algorithmic Approach to Database Normalization
An Algorithmic Approach to Database Normalization M. Demba College of Computer Science and Information Aljouf University, Kingdom of Saudi Arabia bah.demba@ju.edu.sa ABSTRACT When an attempt is made to
More informationLecture Notes on Database Normalization
Lecture Notes on Database Normalization Chengkai Li Department of Computer Science and Engineering The University of Texas at Arlington April 15, 2012 I decided to write this document, because many students
More informationRelational Database Design: FD s & BCNF
CS145 Lecture Notes #5 Relational Database Design: FD s & BCNF Motivation Automatic translation from E/R or ODL may not produce the best relational design possible Sometimes database designers like to
More informationNeighborhood Data and Database Security
Neighborhood Data and Database Security Kioumars Yazdanian, FrkdCric Cuppens e-mail: yaz@ tls-cs.cert.fr - cuppens@ tls-cs.cert.fr CERT / ONERA, Dept. of Computer Science 2 avenue E. Belin, B.P. 4025,31055
More informationCS143 Notes: Normalization Theory
CS143 Notes: Normalization Theory Book Chapters (4th) Chapters 7.1-6, 7.8, 7.10 (5th) Chapters 7.1-6, 7.8 (6th) Chapters 8.1-6, 8.8 INTRODUCTION Main question How do we design good tables for a relational
More informationChapter 7: Relational Database Design
Chapter 7: Relational Database Design Database System Concepts, 5th Ed. See www.db book.com for conditions on re use Chapter 7: Relational Database Design Features of Good Relational Design Atomic Domains
More informationFunctional Dependencies and Finding a Minimal Cover
Functional Dependencies and Finding a Minimal Cover Robert Soulé 1 Normalization An anomaly occurs in a database when you can update, insert, or delete data, and get undesired side-effects. These side
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationWeek 11: Normal Forms. Logical Database Design. Normal Forms and Normalization. Examples of Redundancy
Week 11: Normal Forms Database Design Database Redundancies and Anomalies Functional Dependencies Entailment, Closure and Equivalence Lossless Decompositions The Third Normal Form (3NF) The Boyce-Codd
More informationDatabase Design and Normalization
Database Design and Normalization Chapter 10 (Week 11) EE562 Slides and Modified Slides from Database Management Systems, R. Ramakrishnan 1 Computing Closure F + Example: List all FDs with: - a single
More informationOn the number of lines of theorems in the formal system MIU
On the number of lines of theorems in the formal system MIU Armando B. Matos Technical Report Series: DCC -- -- Departamento de Ciência de Computadores Faculdade de Ciências & Laboratório de Inteligência
More informationSystem BV is NP-complete
System BV is NP-complete Ozan Kahramanoğulları 1,2 Computer Science Institute, University of Leipzig International Center for Computational Logic, TU Dresden Abstract System BV is an extension of multiplicative
More informationTheory behind Normalization & DB Design. Satisfiability: Does an FD hold? Lecture 12
Theory behind Normalization & DB Design Lecture 12 Satisfiability: Does an FD hold? Satisfiability of FDs Given: FD X Y and relation R Output: Does R satisfy X Y? Algorithm: a.sort R on X b.do all the
More informationOn Development of Fuzzy Relational Database Applications
On Development of Fuzzy Relational Database Applications Srdjan Skrbic Faculty of Science Trg Dositeja Obradovica 3 21000 Novi Sad Serbia shkrba@uns.ns.ac.yu Aleksandar Takači Faculty of Technology Bulevar
More informationRemoving Partial Inconsistency in Valuation- Based Systems*
Removing Partial Inconsistency in Valuation- Based Systems* Luis M. de Campos and Serafín Moral Departamento de Ciencias de la Computación e I.A., Universidad de Granada, 18071 Granada, Spain This paper
More informationHow To Find Out What A Key Is In A Database Engine
Database design theory, Part I Functional dependencies Introduction As we saw in the last segment, designing a good database is a non trivial matter. The E/R model gives a useful rapid prototyping tool,
More informationnormalisation Goals: Suppose we have a db scheme: is it good? define precise notions of the qualities of a relational database scheme
Goals: Suppose we have a db scheme: is it good? Suppose we have a db scheme derived from an ER diagram: is it good? define precise notions of the qualities of a relational database scheme define algorithms
More informationTableaux Modulo Theories using Superdeduction
Tableaux Modulo Theories using Superdeduction An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover Mélanie Jacquel 1, Karim Berkani 1, David Delahaye 2, and Catherine
More informationCSE 459/598: Logic for Computer Scientists (Spring 2012)
CSE 459/598: Logic for Computer Scientists (Spring 2012) Time and Place: T Th 10:30-11:45 a.m., M1-09 Instructor: Joohyung Lee (joolee@asu.edu) Instructor s Office Hours: T Th 4:30-5:30 p.m. and by appointment
More informationChapter 10. Functional Dependencies and Normalization for Relational Databases
Chapter 10 Functional Dependencies and Normalization for Relational Databases Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of the Relation Attributes 1.2 Redundant
More informationCorrespondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
More informationSchema Refinement, Functional Dependencies, Normalization
Schema Refinement, Functional Dependencies, Normalization MSCI 346: Database Systems Güneş Aluç, University of Waterloo Spring 2015 MSCI 346: Database Systems Chapter 19 1 / 42 Outline 1 Introduction Design
More informationEFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP
EFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP Hong Jiang Mathematics & Computer Science Department, Benedict College, USA jiangh@benedict.edu ABSTRACT DCSP (Distributed Constraint Satisfaction Problem) has
More informationSPARQL: Un Lenguaje de Consulta para la Web
SPARQL: Un Lenguaje de Consulta para la Web Semántica Marcelo Arenas Pontificia Universidad Católica de Chile y Centro de Investigación de la Web M. Arenas SPARQL: Un Lenguaje de Consulta para la Web Semántica
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
More informationSchema Refinement and Normalization
Schema Refinement and Normalization Module 5, Lectures 3 and 4 Database Management Systems, R. Ramakrishnan 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational
More informationDesign of Relational Database Schemas
Design of Relational Database Schemas T. M. Murali October 27, November 1, 2010 Plan Till Thanksgiving What are the typical problems or anomalies in relational designs? Introduce the idea of decomposing
More informationIs Sometime Ever Better Than Alway?
Is Sometime Ever Better Than Alway? DAVID GRIES Cornell University The "intermittent assertion" method for proving programs correct is explained and compared with the conventional method. Simple conventional
More informationCMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma
CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are
More informationComposing Schema Mappings: An Overview
Composing Schema Mappings: An Overview Phokion G. Kolaitis UC Santa Scruz & IBM Almaden Joint work with Ronald Fagin, Lucian Popa, and Wang-Chiew Tan The Data Interoperability Challenge Data may reside
More informationUPDATES OF LOGIC PROGRAMS
Computing and Informatics, Vol. 20, 2001,????, V 2006-Nov-6 UPDATES OF LOGIC PROGRAMS Ján Šefránek Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University,
More informationTwo approaches to the integration of heterogeneous data warehouses
Distrib Parallel Databases (2008) 23: 69 97 DOI 10.1007/s10619-007-7022-z Two approaches to the integration of heterogeneous data warehouses Riccardo Torlone Published online: 23 December 2007 Springer
More informationSchema Mappings and Data Exchange
Schema Mappings and Data Exchange Phokion G. Kolaitis University of California, Santa Cruz & IBM Research-Almaden EASSLC 2012 Southwest University August 2012 1 Logic and Databases Extensive interaction
More informationSECURITY AND DATA MINING
SECURITY AND DATA MINING T. Y. Lin Mathematics and Computer Science Department, San Jose State University San Jose, California 95120, USA 408-924-512(voice), 408-924-5080 (fax), tylin@cs.sjsu.edu T. H.
More informationA Modular Representation of a Business Process Planner
A Modular Representation of a Business Process Planner Shahab Tasharrofi and Evgenia Ternovska School of Computing Science Simon Fraser University Canada 1st International Workshop on Knowledge-intensive
More informationComputing divisors and common multiples of quasi-linear ordinary differential equations
Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr
More informationCS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing
CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationRigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationExtending Semantic Resolution via Automated Model Building: applications
Extending Semantic Resolution via Automated Model Building: applications Ricardo Caferra Nicolas Peltier LIFIA-IMAG L1F1A-IMAG 46, Avenue Felix Viallet 46, Avenue Felix Viallei 38031 Grenoble Cedex FRANCE
More informationAutomated Theorem Proving - summary of lecture 1
Automated Theorem Proving - summary of lecture 1 1 Introduction Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement is a logical consequence of
More informationArtificial Intelligence in Knowledge-based Technologies and Systems
Computer Science and Information Technology 4(1): 27-32, 2016 DOI: 10.13189/csit.2016.040105 http://www.hrpub.org Artificial Intelligence in Knowledge-based Technologies and Systems Viktor Krasnoproshin
More informationLogical and categorical methods in data transformation (TransLoCaTe)
Logical and categorical methods in data transformation (TransLoCaTe) 1 Introduction to the abbreviated project description This is an abbreviated project description of the TransLoCaTe project, with an
More informationData Quality in Information Integration and Business Intelligence
Data Quality in Information Integration and Business Intelligence Leopoldo Bertossi Carleton University School of Computer Science Ottawa, Canada : Faculty Fellow of the IBM Center for Advanced Studies
More informationNormalisation. Why normalise? To improve (simplify) database design in order to. Avoid update problems Avoid redundancy Simplify update operations
Normalisation Why normalise? To improve (simplify) database design in order to Avoid update problems Avoid redundancy Simplify update operations 1 Example ( the practical difference between a first normal
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationRelational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 18 Relational data model Domain domain: predefined set of atomic values: integers, strings,... every attribute
More informationNormalization in Database Design
in Database Design Marek Rychly mrychly@strathmore.edu Strathmore University, @ilabafrica & Brno University of Technology, Faculty of Information Technology Advanced Databases and Enterprise Systems 14
More informationNormalisation in the Presence of Lists
1 Normalisation in the Presence of Lists Sven Hartmann, Sebastian Link Information Science Research Centre, Massey University, Palmerston North, New Zealand 1. Motivation & Revision of the RDM 2. The Brouwerian
More informationCOMPUTER SCIENCE TRIPOS
CST.98.5.1 COMPUTER SCIENCE TRIPOS Part IB Wednesday 3 June 1998 1.30 to 4.30 Paper 5 Answer five questions. No more than two questions from any one section are to be answered. Submit the answers in five
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationPolicy Analysis for Administrative Role Based Access Control without Separate Administration
Policy nalysis for dministrative Role Based ccess Control without Separate dministration Ping Yang Department of Computer Science, State University of New York at Binghamton, US Mikhail I. Gofman Department
More information3. Relational Model and Relational Algebra
ECS-165A WQ 11 36 3. Relational Model and Relational Algebra Contents Fundamental Concepts of the Relational Model Integrity Constraints Translation ER schema Relational Database Schema Relational Algebra
More informationAn Efficient and Scalable Management of Ontology
An Efficient and Scalable Management of Ontology Myung-Jae Park 1, Jihyun Lee 1, Chun-Hee Lee 1, Jiexi Lin 1, Olivier Serres 2, and Chin-Wan Chung 1 1 Korea Advanced Institute of Science and Technology,
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More informationA first step towards modeling semistructured data in hybrid multimodal logic
A first step towards modeling semistructured data in hybrid multimodal logic Nicole Bidoit * Serenella Cerrito ** Virginie Thion * * LRI UMR CNRS 8623, Université Paris 11, Centre d Orsay. ** LaMI UMR
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationDatabase Constraints and Design
Database Constraints and Design We know that databases are often required to satisfy some integrity constraints. The most common ones are functional and inclusion dependencies. We ll study properties of
More informationON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information
More informationDisjunction of Non-Binary and Numeric Constraint Satisfaction Problems
Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems Miguel A. Salido, Federico Barber Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia Camino
More informationWhich Semantics for Neighbourhood Semantics?
Which Semantics for Neighbourhood Semantics? Carlos Areces INRIA Nancy, Grand Est, France Diego Figueira INRIA, LSV, ENS Cachan, France Abstract In this article we discuss two alternative proposals for
More informationfacultad de informática universidad politécnica de madrid
facultad de informática universidad politécnica de madrid On the Confluence of CHR Analytical Semantics Rémy Haemmerlé Universidad olitécnica de Madrid & IMDEA Software Institute, Spain TR Number CLI2/2014.0
More informationAn Ontology Based Method to Solve Query Identifier Heterogeneity in Post- Genomic Clinical Trials
ehealth Beyond the Horizon Get IT There S.K. Andersen et al. (Eds.) IOS Press, 2008 2008 Organizing Committee of MIE 2008. All rights reserved. 3 An Ontology Based Method to Solve Query Identifier Heterogeneity
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationDiscovery of Data Dependencies in Relational Databases
Discovery of Data Dependencies in Relational Databases Siegfried Bell & Peter Brockhausen Informatik VIII, University Dortmund 44221 Dortmund, Germany email: fbell; brockhg@ls8.informatik.uni-dortmund.de
More informationDatabase Management Systems. Redundancy and Other Problems. Redundancy
Database Management Systems Winter 2004 CMPUT 391: Database Design Theory or Relational Normalization Theory Dr. Osmar R. Zaïane Lecture 2 Limitations of Relational Database Designs Provides a set of guidelines,
More informationRelational Database Basics Review
Relational Database Basics Review IT 4153 Advanced Database J.G. Zheng Spring 2012 Overview Database approach Database system Relational model Database development 2 File Processing Approaches Based on
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationTheory of Relational Database Design and Normalization
Theory of Relational Database Design and Normalization (Based on Chapter 14 and some part of Chapter 15 in Fundamentals of Database Systems by Elmasri and Navathe, Ed. 3) 1 Informal Design Guidelines for
More informationPropagating Functional Dependencies with Conditions
Propagating Functional Dependencies with Conditions Wenfei Fan 1,2,3 Shuai Ma 1 Yanli Hu 1,5 Jie Liu 4 Yinghui Wu 1 1 University of Edinburgh 2 Bell Laboratories 3 Harbin Institute of Technologies 4 Chinese
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More informationA View Integration Approach to Dynamic Composition of Web Services
A View Integration Approach to Dynamic Composition of Web Services Snehal Thakkar, Craig A. Knoblock, and José Luis Ambite University of Southern California/ Information Sciences Institute 4676 Admiralty
More informationA Note on Context Logic
A Note on Context Logic Philippa Gardner Imperial College London This note describes joint work with Cristiano Calcagno and Uri Zarfaty. It introduces the general theory of Context Logic, and has been
More informationSchema Design and Normal Forms Sid Name Level Rating Wage Hours
Entity-Relationship Diagram Schema Design and Sid Name Level Rating Wage Hours Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Database Management Systems, 2 nd Edition. R. Ramakrishnan
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationIntegrating Data from Possibly Inconsistent Databases
Integrating Data from Possibly Inconsistent Databases Phan Minh Dung Department of Computer Science Asian Institute of Technology PO Box 2754, Bangkok 10501, Thailand dung@cs.ait.ac.th Abstract We address
More informationConditional-Functional-Dependencies Discovery
Conditional-Functional-Dependencies Discovery Raoul Medina 1 Lhouari Nourine 2 Research Report LIMOS/RR-08-13 19 décembre 2008 1 medina@isima.fr 2 nourine@isima.fr, Université Blaise Pascal LIMOS Campus
More informationRelational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology
COS 597A: Principles of Database and Information Systems elational model elational model A formal (mathematical) model to represent objects (data/information), relationships between objects Constraints
More informationBiinterpretability up to double jump in the degrees
Biinterpretability up to double jump in the degrees below 0 0 Richard A. Shore Department of Mathematics Cornell University Ithaca NY 14853 July 29, 2013 Abstract We prove that, for every z 0 0 with z
More informationCopyright 2012 MECS I.J.Information Technology and Computer Science, 2012, 1, 50-63
I.J. Information Technology and Computer Science, 2012, 1, 50-63 Published Online February 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijitcs.2012.01.07 Using Logic Programming to Represent
More informationIntroducing Formal Methods. Software Engineering and Formal Methods
Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended
More informationRough Sets and Fuzzy Rough Sets: Models and Applications
Rough Sets and Fuzzy Rough Sets: Models and Applications Chris Cornelis Department of Applied Mathematics and Computer Science, Ghent University, Belgium XV Congreso Español sobre Tecnologías y Lógica
More informationLimitations of E-R Designs. Relational Normalization Theory. Redundancy and Other Problems. Redundancy. Anomalies. Example
Limitations of E-R Designs Relational Normalization Theory Chapter 6 Provides a set of guidelines, does not result in a unique database schema Does not provide a way of evaluating alternative schemas Normalization
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationMATHEMATICAL LOGIC FOR COMPUTER SCIENCE
MATHEMATICAL LOGIC FOR COMPUTER SCIENCE Second Edition WORLD SCIENTIFIC SERIES IN COMPUTER SCIENCE 25: Computer Epistemology A Treatise on the Feasibility of the Unfeasible or Old Ideas Brewed New (T Vamos)
More informationIncorporating record subtyping into a relational data model
Incorporating record subtyping into a relational data model Christian Kalus, Peter Dadam Faculty of Computer Science, Dept. Databases and Information Systems University of Ulm, D 89069 Ulm, Germany e-mail:
More informationCompleting Description Logic Knowledge Bases using Formal Concept Analysis
Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader, 1 Bernhard Ganter, 1 Barış Sertkaya, 1 and Ulrike Sattler 2 1 TU Dresden, Germany and 2 The University of Manchester,
More informationHigh Integrity Software Conference, Albuquerque, New Mexico, October 1997.
Meta-Amphion: Scaling up High-Assurance Deductive Program Synthesis Steve Roach Recom Technologies NASA Ames Research Center Code IC, MS 269-2 Moffett Field, CA 94035 sroach@ptolemy.arc.nasa.gov Jeff Van
More informationSemantic Errors in SQL Queries: A Quite Complete List
Semantic Errors in SQL Queries: A Quite Complete List Christian Goldberg, Stefan Brass Martin-Luther-Universität Halle-Wittenberg {goldberg,brass}@informatik.uni-halle.de Abstract We investigate classes
More information