Dependency-Preserving Normalization of Relational and XML Data (Appendix)

Size: px
Start display at page:

Download "Dependency-Preserving Normalization of Relational and XML Data (Appendix)"

Transcription

1 Dependency-Preserving Normalization of Relational and XML Data (Appendix) Solmaz Kolahi Department of Computer Science, University of Toronto Proof of Theorem ( ) Suppose (R,Σ) is in 3NF and I inst(r,σ). Having INF I (p Σ) < for some p = (R, t,a) in Pos(I) means that there is redundant information in position p. Since we assume Σ only contains FDs, there must be an FD X A Σ + and a different tuple t in I, such that t[x] = t [X] and therefore t[a] = t [A]. This can only happen when X is not a key. Thus, A is a prime attribute. ( ) Assume that there is an FD X A Σ +, such that X is not a key for R and A is not prime. We show that there is an instance I inst(r,σ) and position p Pos(I) such that INF I (p Σ) <. Let I be an instance of (R,Σ) containing two tuples t,t 2 defined as follows. For every B sort(r), t [B] =. If B X +, t 2 [B] =, otherwise t 2 [B] = 2. It is easy to see that I satisfies Σ, and for position p = (R,t,A) we have INF I (p Σ) <. This contradicts the assumption that for every non-prime attribute A and position p = (R, t,a), we have INF I (p Σ) =. Proof of Claim 3.2 For proving this claim, we use the following lemma from [5]: Lemma. Let Σ be a set of FDs over a relational schema R, I inst(r,σ), p Pos(I) and ā Ω(I, p). Then lim k log k a [,k] P(a ā)log P(a ā) is either 0 or. Let n = Pos(I) in Example. By definition, for position p: INF I (p Σ) = lim k log k = 2 n ā Ω(I,p) lim k ā Ω(I,p) 2 n log k a [,k] a [,k] P(a ā)log P(a ā)log P(a ā) P(a ā).

2 2 Solmaz Kolahi Therefore, according to Lemma we have to count the number of ā s in Ω(I,p) for which lim k log k a [,k] P(a ā) log P(a ā) = in order to find the information content of position p. It is easy to see that this limit is zero iff the value in position p is forced by the constants in ā and the FDs in Σ; i.e. for only one value a in the active domain of I we have p(a ā) = and for a a, p(a ā) = 0. Fix ā Ω(I,p). Let t 0 denote the tuple in ā corresponding to the first row of the instance. Suppose {B j t 0 [B j ] is constant, j [,m]} = i. If an arbitrary tuple t t 0 in ā does not force a value for p, either of the following cases should hold: t[a] is a variable. In this case t can have either constants or variables for other attributes, so we can have 2 m+ different shapes for t. t[a] is a constant. In this case t can only have variables for the attributes in {B j t 0 [B j ] is constant, j [, m]} and constants or variables for other attributes. Therefore, we can have 2 m i+ different shapes for t. Now we count the number of ā s that only contain tuples of the above form. We can have 2 ( ) m i different t0 s, and for each t 0, each of the other tuples can be in 2 m+ +2 m i+ different shapes. Furthermore, i can range over [0,m]. Therefore, when the number of tuples in the instance is tup, the number of ā s that do not force a value for position p is: m ( ) m 2 (2 m+ + 2 m i+ ) tup. i i=0 To obtain the information content of position p, we should divide this number by 2 n which is the total number of ā s. Note that n = tup (m + 2). Thus: INF I (p Σ) = Proof of Theorem 3 = 2 tup (m+2) i=0 ( m m i i=0 m ( m 2 i ) ( + 2 i ) tup. 2 tup +m ) (2 m+ + 2 m i+ ) tup ( ) Suppose (D, Σ) is in XNF and the FD X p.@l is in (D, Σ) +. Then the FD X p is also in (D, Σ) +. Let T be an arbitrary XML tree conforming to D and satisfying Σ. For every two tree tuples t,t 2 in T, if t and t 2 agree on all paths in X (t (q) = t 2 (q) for all q X), then t (p) = t 2 (p) = v. Trivially, t (v ) = t 2 (v ) for every node v an ancestor of v in tree T, so for every path q a prefix of p and every defined for last(q), T satisfies the FDs X q and X q.@m. Therefore, X q.@m is in (D, Σ) +. ( ) The proof of the other direction follows from the FDs resulting from hierarchical representation of relational attributes. Suppose an FD X p.@l is in (D, Σ) +. Then for every prefix q of p and the defined for last(q) the

3 Appendix 3 FD X q.@m is also in (D, Σ) +. Let T be an arbitrary XML tree conforming to D and satisfying Σ. If two tree tuples t,t 2 from T agree on all the attributes of elements from the root to last(p), they will agree on the nodes corresponding to element types from the root to last(p) as well. This is because of the FDs of the form {p,p.τ i.@l i } p.τ i that are added to Σ during the construction of (D, Σ). Therefore, for all paths q a prefix of p the FD X q is in (D, Σ) +. In particular, X p (D, Σ) +, and hence (D, Σ) is in XNF. Proof of Theorem 4 Consider the relational schema R = (A, B,C, D,F) and the following set F of FDs over it: ABCD F FD A FC B It was shown in Example 3 that we cannot find an appropriate ordering of the attributes in order to give a hierarchical XNF representation of (R, F). Now consider an arbitrary non-xnf hierarchical translation (D, Σ) of (R, F): E = {r,a, B,C, D,F }. A P(r) = A, P(A) = B, P(B) = C, P(C) = D, P(D) = F, P(F) = ǫ. R(r) =, R(A) = {@a}, R(B) = {@b}, R(C) = {@c}, R(D) = {@d}, R(F) = {@f}. Σ = { {r.a.@a} r.a, {r.a, r.a.b.@b} r.a.b, {r.a.b, r.a.b.c.@c} r.a.b.c, {r.a.b.c, r.a.b.c.d.@d} r.a.b.c.d, {r.a.b.c.d, r.a.b.c.d.f.@f} r.a.b.c.d.f, {r.a.@a, r.a.b.@b, r.a.b.c.@c, r.a.b.c.d.@d} r.a.b.c.d.f.@f, {r.a.b.c.d.f.@f, r.a.b.c.d.@d} r.a.@a, {r.a.b.c.d.f.@f, r.a.b.c.@c} r.a.b.@b}. Now we informally show that no matter how we restructure (D, Σ) into another XML specification (D,Σ ), either the new XML specification is not in XNF, or the FDs are not preserved. Suppose there is a dependency-preserving XNF decomposition (D,Σ ), obtained from the above (D,Σ). Assume that p A.@a, p B.@b, p C.@c, p D.@d and p F.@f in paths(d ) are mapped to r.a.@a, r.a.b.@b, r.a.b.c.@c, r.a.b.c.d.@d, and r.a.b.c.d.f.@f in paths(d) respectively. Neither of p A and p B can be a prefix of the other, because if so, either of the functional dependencies {p F.@f, p C.@c} p A.@a or {p F.@f,p D.@d} p B.@b must also be in (D,Σ ) +, which is not desirable. Therefore, assuming p AB is the longest common prefix of p A, p B and τ = last(p AB ),A = last(p A ),B = last(p B ), one of the following cases must be true:

4 4 Solmaz Kolahi For every XML tree T = (D, Σ ), and every element node corresponding to τ in T, there is only one pair of nodes corresponding to elements A and B, i.e. p AB {p A,p B }. Since the decomposition is dependencypreserving, {p F.@f,p D.@d} p A.@a (D,Σ ) +. Since (D,Σ ) is in XNF, {p F.@f, p D.@d} p A is also in (D,Σ ) +, and because p AB is a prefix of p A, {p F.@f, p D.@d} p AB (D, Σ ) +. Thus the FDs {p F.@f, p D.@d} p B and {p F.@f,p D.@d} p B.@b, which are spurious, should be in (D,Σ ) + as well. For every XML tree T = (D,Σ ), and every element node corresponding to τ in T, there can be more than one pair of nodes corresponding to elements A and B. Here, there is no mechanism to s s, so spurious tree tuples will appear. Since these two attributes participate in a single functional dependency, these extra tuples may lead the XML tree not to satisfy the functional dependency. Therefore, the decomposition cannot be dependency-preserving. Proof of Proposition We first need to prove the following claim. Claim. The FD A i...a ik A i is in F + iff the FD {r.g.@a i,...,r.g.@a ik } r.g.@a i is in (D R,Σ F ) +. The proof of this claim follows from the fact that for each instance I of R, there is an XML tree T I conforming to D R such that I = F iff T I = Σ F. Moreover, for each XML tree T conforming to D R and satisfying the FD {r.g.@a,...,r.g.@a m } r.g, there is an instance I T of R such that T = Σ F iff I T = F. Now we prove the proposition for the case of 3NF and X3NF. ( ) Suppose that (R, F) is in 3NF. we prove that (D R,Σ F ) is in X3NF. Suppose that there is a nontrivial FD S r.g.@a i in (D R,Σ F ) +. The element paths r and r.g cannot be in S, because if two tree tuples agree on element paths r or r.g, they agree on every other path, and the FD will be trivially satisfied. Therefore, S r.g.@a i is of the form {r.g.@a i,...,r.g.@a ik } r.g.@a i. By the above claim, there is an FD in F of the form A i...a ik A i. Since (R, F) is in 3NF, at least one of the following should be true that implies (D R,Σ F ) is in X3NF. The attributes A i...a ik form a key, and hence for every j [,m], the FD {r.g.@a i,...,r.g.@a ik } r.g.@a j is in (D R,Σ F ) +. Since (D R,Σ F ) + contains the FD {r.g.@a,...,r.g.@a m } r.g, it should also contain {r.g.@a i,...,r.g.@a ik } r.g. Therefore S r.g (D R, Σ F ) +. The attribute A i is prime, so there is an FD in F + of the form A l...a lt A i A...A m. Therefore, there is an FD S G in (D R,Σ F ) + such that r.g.@a i S. Moreover, since A l...a lt is not a key, S {r.g.@ai} G (D R,Σ F ) +. Thus r.g.@a i is prime.

5 Appendix 5 ( ) Suppose that (D R, Σ F ) is in X3NF. We prove that (R, F) is in 3NF. Let A i...a ik A i be a nontrivial FD in F +. Then there must be an FD {r.g.@a i,...,r.g.@a ik } r.g.@a i in (D R,Σ F ) + by the above claim. Since (D R, Σ F ) is in X3NF, at least one of the following should be true that implies (R, F) is in 3NF. The FD {r.g.@a i,...,r.g.@a ik } r.g is in (D R,Σ F ) + which easily implies A i...a ik is a key. The attribute path r.g.@a i is prime, so there is a nontrivial FD S p in (D R,Σ F ) + s.t. r.g.@a i S, S is minimal, and p is an element path. Since this FD is not trivial, the element path p cannot be r, and there is no element path in S, so S p is of the form {r.g.@a l,...,r.g.@a lt, r.g.@a i } r.g. Thus, for every j [,m], the FD {r.g.@a l,...,r.g.@a lt,r.g.@a i } r.g.@a j is in (D R,Σ F ) +, and this implies A l...a lt,a i is a key for R. Since S is minimal, A l...a lt, A i is a candidate key, and hence A i is prime. Proof of Proposition 2 Let (D, Σ) be a hierarchical translation of relational specification (R, F) obtained from any ordering of attributes in R. We first need to prove the following claims. Claim. Any FD S p in (D, Σ) + is equivalent to an FD of the form S p where S only contains attribute paths. The proof of this claim follows from the following fact: for every XML tree T conforming to D and satisfying Σ and every two tree tuples t,t 2 in T, t,t 2 agree on an element path q paths(d), iff they agree on every attribute path q.@m such that q is a prefix of q. This is because of the FDs of the form {p,p.τ.@l} p.τ that are added to Σ during the construction of (D,Σ). Claim. The FD A i...a ik A ik+ is in F + iff the FD {p i.@l i,...,p ik.@l ik } p ik+.@l ik+ is in (D R,Σ F ) +, where for every j [,k + ], the last element of p ij corresponds to relational attribute A ij. The proof of this claim follows from the fact that in our translation of relational data into XML, tree tuples fully represent relational tuples. Now we prove the proposition for the case of 3NF and X3NF. Suppose there is an FD of the form S p.@l in (D,Σ) +. By the first claim, this FD can be written as {p i.@l i,...,p ik.@l ik } p.@l, and by the second claim, the FD A i...a ik A should be in F +. Since (R, F) is in 3NF, one of the following cases is true that implies (D, Σ) is in X3NF. A i...a ik forms a key for R, i.e. the values of A i...a ik identify a unique tuple in any instance I of (R, F). Every relational tuple corresponds to a single tree tuple in the XML tree T that represents the relational instance I. This means if two tree tuples t,t 2 in T agree on {p i.@l i,...,p ik.@l ik }, they are equal. Thus, {p i.@l i,...,p ik.@l ik } implies every element path q and in particular p. Therefore, S p is in (D, Σ) +.

6 6 Solmaz Kolahi A is prime. Equivalently, p.@l is contained in minimal set S that implies every element path q, and hence p.@l is a prime attribute path.

Introduction to Data Management CSE 344

Introduction to Data Management CSE 344 Introduction to Data Management CSE 344 Lectures 18: BCNF 1 What makes good schemas? 2 Review: Relation Decomposition Break the relation into two: Name SSN PhoneNumber City Fred 123-45-6789 206-555-1234

More information

Functional Dependencies and Normalization

Functional Dependencies and Normalization Functional Dependencies and Normalization There are many forms of constraints on relational database schemata other than key dependencies. Undoubtedly most important is the functional dependency. A functional

More information

Relational Design Theory II. Detecting Anomalies. Normal Forms. Normalization

Relational Design Theory II. Detecting Anomalies. Normal Forms. Normalization Relational Design Theory II Normalization Detecting Anomalies SID Activity Fee Tax 1001 Piano $20 $2.00 1090 Swimming $15 $1.50 1001 Swimming $15 $1.50 Why is this bad design? Can we capture this using

More information

Chapter 3 Design Theory for Relational Databases

Chapter 3 Design Theory for Relational Databases 1 Chapter 3 Design Theory for Relational Databases Contents Functional Dependencies Decompositions Normal Forms (BCNF, 3NF) Multivalued Dependencies (and 4NF) Reasoning About FD s + MVD s 2 Remember our

More information

Chapter 11, Relational Database Design Algorithms and Further Dependencies

Chapter 11, Relational Database Design Algorithms and Further Dependencies Chapter 11, Relational Database Design Algorithms and Further Dependencies Normal forms are insufficient on their own as a criteria for a good relational database schema design. The relations in a database

More information

CSC 261/461 Database Systems Lecture 13. Spring 2018

CSC 261/461 Database Systems Lecture 13. Spring 2018 CSC 261/461 Database Systems Lecture 13 Spring 2018 BCNF Decomposition Algorithm BCNFDecomp(R): Find X s.t.: X + X and X + [all attributes] if (not found) then Return R let Y = X + - X, Z = (X + ) C decompose

More information

DESIGN THEORY FOR RELATIONAL DATABASES. csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Meraji Winter 2018

DESIGN THEORY FOR RELATIONAL DATABASES. csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Meraji Winter 2018 DESIGN THEORY FOR RELATIONAL DATABASES csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Meraji Winter 2018 1 Introduction There are always many different schemas for a given

More information

Normal Forms Lossless Join.

Normal Forms Lossless Join. Normal Forms Lossless Join http://users.encs.concordia.ca/~m_oran/ 1 Types of Normal Forms A relation schema R is in the first normal form (1NF) if the domain of its each attribute has only atomic values

More information

Chapter 3 Design Theory for Relational Databases

Chapter 3 Design Theory for Relational Databases 1 Chapter 3 Design Theory for Relational Databases Contents Functional Dependencies Decompositions Normal Forms (BCNF, 3NF) Multivalued Dependencies (and 4NF) Reasoning About FD s + MVD s 2 Our example

More information

Comp 5311 Database Management Systems. 5. Functional Dependencies Exercises

Comp 5311 Database Management Systems. 5. Functional Dependencies Exercises Comp 5311 Database Management Systems 5. Functional Dependencies Exercises 1 Assume the following table contains the only set of tuples that may appear in a table R. Which of the following FDs hold in

More information

LOGICAL DATABASE DESIGN Part #1/2

LOGICAL DATABASE DESIGN Part #1/2 LOGICAL DATABASE DESIGN Part #1/2 Functional Dependencies Informally, a FD appears when the values of a set of attributes uniquely determines the values of another set of attributes. Example: schedule

More information

Relational Design Theory

Relational Design Theory Relational Design Theory CSE462 Database Concepts Demian Lessa/Jan Chomicki Department of Computer Science and Engineering State University of New York, Buffalo Fall 2013 Overview How does one design a

More information

CSC 261/461 Database Systems Lecture 11

CSC 261/461 Database Systems Lecture 11 CSC 261/461 Database Systems Lecture 11 Fall 2017 Announcement Read the textbook! Chapter 8: Will cover later; But self-study the chapter Everything except Section 8.4 Chapter 14: Section 14.1 14.5 Chapter

More information

CSE 344 MAY 16 TH NORMALIZATION

CSE 344 MAY 16 TH NORMALIZATION CSE 344 MAY 16 TH NORMALIZATION ADMINISTRIVIA HW6 Due Tonight Prioritize local runs OQ6 Out Today HW7 Out Today E/R + Normalization Exams In my office; Regrades through me DATABASE DESIGN PROCESS Conceptual

More information

11/1/12. Relational Schema Design. Relational Schema Design. Relational Schema Design. Relational Schema Design (or Logical Design)

11/1/12. Relational Schema Design. Relational Schema Design. Relational Schema Design. Relational Schema Design (or Logical Design) Relational Schema Design Introduction to Management CSE 344 Lectures 16: Database Design Conceptual Model: Relational Model: plus FD s name Product buys Person price name ssn Normalization: Eliminates

More information

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop Fall 2017 Inverse of a matrix Authors: Alexander Knop Institute: UC San Diego Row-Column Rule If the product AB is defined, then the entry in row i and column j of AB is the sum of the products of corresponding

More information

Relational-Database Design

Relational-Database Design C H A P T E R 7 Relational-Database Design Exercises 7.2 Answer: A decomposition {R 1, R 2 } is a lossless-join decomposition if R 1 R 2 R 1 or R 1 R 2 R 2. Let R 1 =(A, B, C), R 2 =(A, D, E), and R 1

More information

Design Theory for Relational Databases

Design Theory for Relational Databases Design Theory for Relational Databases Keys: formal definition K is a superkey for relation R if K functionally determines all attributes of R K is a key for R if K is a superkey, but no proper subset

More information

UVA UVA UVA UVA. Database Design. Relational Database Design. Functional Dependency. Loss of Information

UVA UVA UVA UVA. Database Design. Relational Database Design. Functional Dependency. Loss of Information Relational Database Design Database Design To generate a set of relation schemas that allows - to store information without unnecessary redundancy - to retrieve desired information easily Approach - design

More information

Design Theory for Relational Databases. Spring 2011 Instructor: Hassan Khosravi

Design Theory for Relational Databases. Spring 2011 Instructor: Hassan Khosravi Design Theory for Relational Databases Spring 2011 Instructor: Hassan Khosravi Chapter 3: Design Theory for Relational Database 3.1 Functional Dependencies 3.2 Rules About Functional Dependencies 3.3 Design

More information

Relational Database Design

Relational Database Design Relational Database Design Chapter 15 in 6 th Edition 2018/4/6 1 10 Relational Database Design Anomalies can be removed from relation designs by decomposing them until they are in a normal form. Several

More information

COMMUTING ELEMENTS IN GALOIS GROUPS OF FUNCTION FIELDS. Fedor Bogomolov and Yuri Tschinkel

COMMUTING ELEMENTS IN GALOIS GROUPS OF FUNCTION FIELDS. Fedor Bogomolov and Yuri Tschinkel COMMUTING ELEMENTS IN GALOIS GROUPS OF FUNCTION FIELDS by Fedor Bogomolov and Yuri Tschinkel Abstract. We study the structure of abelian subgroups of Galois groups of function fields. Contents Introduction................................................

More information

Relational Database Design

Relational Database Design Relational Database Design Jan Chomicki University at Buffalo Jan Chomicki () Relational database design 1 / 16 Outline 1 Functional dependencies 2 Normal forms 3 Multivalued dependencies Jan Chomicki

More information

Design theory for relational databases

Design theory for relational databases Design theory for relational databases 1. Consider a relation with schema R(A,B,C,D) and FD s AB C, C D and D A. a. What are all the nontrivial FD s that follow from the given FD s? You should restrict

More information

12/3/2010 REVIEW ALGEBRA. Exam Su 3:30PM - 6:30PM 2010/12/12 Room C9000

12/3/2010 REVIEW ALGEBRA. Exam Su 3:30PM - 6:30PM 2010/12/12 Room C9000 REVIEW Exam Su 3:30PM - 6:30PM 2010/12/12 Room C9000 2 ALGEBRA 1 RELATIONAL ALGEBRA OPERATIONS Basic operations Selection ( ) Selects a subset of rows from relation. Projection ( ) Deletes unwanted columns

More information

Database Design and Implementation

Database Design and Implementation Database Design and Implementation CS 645 Schema Refinement First Normal Form (1NF) A schema is in 1NF if all tables are flat Student Name GPA Course Student Name GPA Alice 3.8 Bob 3.7 Carol 3.9 Alice

More information

CSE 344 AUGUST 3 RD NORMALIZATION

CSE 344 AUGUST 3 RD NORMALIZATION CSE 344 AUGUST 3 RD NORMALIZATION ADMINISTRIVIA WQ6 due Monday DB design HW7 due next Wednesday DB design normalization DATABASE DESIGN PROCESS Conceptual Model: name product makes company price name address

More information

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd n r t d n 20 20 0 : 0 T P bl D n, l d t z d http:.h th tr t. r pd l 4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n,

More information

10/12/10. Outline. Schema Refinements = Normal Forms. First Normal Form (1NF) Data Anomalies. Relational Schema Design

10/12/10. Outline. Schema Refinements = Normal Forms. First Normal Form (1NF) Data Anomalies. Relational Schema Design Outline Introduction to Database Systems CSE 444 Design theory: 3.1-3.4 [Old edition: 3.4-3.6] Lectures 6-7: Database Design 1 2 Schema Refinements = Normal Forms 1st Normal Form = all tables are flat

More information

CSE 344 AUGUST 6 TH LOSS AND VIEWS

CSE 344 AUGUST 6 TH LOSS AND VIEWS CSE 344 AUGUST 6 TH LOSS AND VIEWS ADMINISTRIVIA WQ6 due tonight HW7 due Wednesday DATABASE DESIGN PROCESS Conceptual Model: name product makes company price name address Relational Model: Tables + constraints

More information

Practice and Applications of Data Management CMPSCI 345. Lecture 16: Schema Design and Normalization

Practice and Applications of Data Management CMPSCI 345. Lecture 16: Schema Design and Normalization Practice and Applications of Data Management CMPSCI 345 Lecture 16: Schema Design and Normalization Keys } A superkey is a set of a/ributes A 1,..., A n s.t. for any other a/ribute B, we have A 1,...,

More information

Relational Design Theory I. Functional Dependencies: why? Redundancy and Anomalies I. Functional Dependencies

Relational Design Theory I. Functional Dependencies: why? Redundancy and Anomalies I. Functional Dependencies Relational Design Theory I Functional Dependencies Functional Dependencies: why? Design methodologies: Bottom up (e.g. binary relational model) Top-down (e.g. ER leads to this) Needed: tools for analysis

More information

Functional Dependencies

Functional Dependencies Functional Dependencies P.J. M c.brien Imperial College London P.J. M c.brien (Imperial College London) Functional Dependencies 1 / 41 Problems in Schemas What is wrong with this schema? bank data no sortcode

More information

1 The Basics: Vectors, Matrices, Matrix Operations

1 The Basics: Vectors, Matrices, Matrix Operations 14.102, Math for Economists Fall 2004 Lecture Notes, 9/9/2004 These notes are primarily based on those written by George Marios Angeletos for the Harvard Math Camp in 1999 and 2000, and updated by Stavros

More information

5. Data dependences and database schema design. Witold Rekuć Data Processing Technology 104

5. Data dependences and database schema design. Witold Rekuć Data Processing Technology 104 5. Data dependences and database schema design Witold Rekuć Data Processing Technology 104 DESIGN OF TABLES Anomalies of data modifications Key = {StoreNo, ProdId, DateOfSale} Witold Rekuć Data Processing

More information

Provenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley

Provenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place of origin Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place

More information

CSE 544 Principles of Database Management Systems

CSE 544 Principles of Database Management Systems CSE 544 Principles of Database Management Systems Lecture 3 Schema Normalization CSE 544 - Winter 2018 1 Announcements Project groups due on Friday First review due on Tuesday (makeup lecture) Run git

More information

Introduction to Management CSE 344

Introduction to Management CSE 344 Introduction to Management CSE 344 Lectures 17: Design Theory 1 Announcements No class/office hour on Monday Midterm on Wednesday (Feb 19) in class HW5 due next Thursday (Feb 20) No WQ next week (WQ6 due

More information

CSC 261/461 Database Systems Lecture 8. Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101

CSC 261/461 Database Systems Lecture 8. Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101 CSC 261/461 Database Systems Lecture 8 Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101 Agenda 1. Database Design 2. Normal forms & functional dependencies 3. Finding functional dependencies

More information

Relational Database Design

Relational Database Design CSL 451 Introduction to Database Systems Relational Database Design Department of Computer Science and Engineering Indian Institute of Technology Ropar Narayanan (CK) Chatapuram Krishnan! Recap - Boyce-Codd

More information

CSC 261/461 Database Systems Lecture 10 (part 2) Spring 2018

CSC 261/461 Database Systems Lecture 10 (part 2) Spring 2018 CSC 261/461 Database Systems Lecture 10 (part 2) Spring 2018 Announcement Read Chapter 14 and 15 You must self-study these chapters Too huge to cover in Lectures Project 2 Part 1 due tonight Agenda 1.

More information

Introduction to Data Management. Lecture #6 (Relational DB Design Theory)

Introduction to Data Management. Lecture #6 (Relational DB Design Theory) Introduction to Data Management Lecture #6 (Relational DB Design Theory) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements v Homework

More information

Lectures 6. Lecture 6: Design Theory

Lectures 6. Lecture 6: Design Theory Lectures 6 Lecture 6: Design Theory Lecture 6 Announcements Solutions to PS1 are posted online. Grades coming soon! Project part 1 is out. Check your groups and let us know if you have any issues. We have

More information

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

n r t d n :4 T P bl D n, l d t z d   th tr t. r pd l n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R

More information

Ma 227 Review for Systems of DEs

Ma 227 Review for Systems of DEs Ma 7 Review for Systems of DEs Matrices Basic Properties Addition and subtraction: Let A a ij mn and B b ij mn.then A B a ij b ij mn 3 A 6 B 6 4 7 6 A B 6 4 3 7 6 6 7 3 Scaler Multiplication: Let k be

More information

Vr Vr

Vr Vr F rt l Pr nt t r : xt rn l ppl t n : Pr nt rv nd PD RDT V t : t t : p bl ( ll R lt: 00.00 L n : n L t pd t : 0 6 20 8 :06: 6 pt (p bl Vr.2 8.0 20 8.0. 6 TH N PD PPL T N N RL http : h b. x v t h. p V l

More information

CSC 261/461 Database Systems Lecture 12. Spring 2018

CSC 261/461 Database Systems Lecture 12. Spring 2018 CSC 261/461 Database Systems Lecture 12 Spring 2018 Announcement Project 1 Milestone 2 due tonight! Read the textbook! Chapter 8: Will cover later; But self-study the chapter Chapter 14: Section 14.1 14.5

More information

Schema Refinement & Normalization Theory

Schema Refinement & Normalization Theory Schema Refinement & Normalization Theory Functional Dependencies Week 13 1 What s the Problem Consider relation obtained (call it SNLRHW) Hourly_Emps(ssn, name, lot, rating, hrly_wage, hrs_worked) What

More information

Information Systems for Engineers. Exercise 8. ETH Zurich, Fall Semester Hand-out Due

Information Systems for Engineers. Exercise 8. ETH Zurich, Fall Semester Hand-out Due Information Systems for Engineers Exercise 8 ETH Zurich, Fall Semester 2017 Hand-out 24.11.2017 Due 01.12.2017 1. (Exercise 3.3.1 in [1]) For each of the following relation schemas and sets of FD s, i)

More information

Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1

Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1 Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1 Background We started with schema design ER model translation into a relational schema Then we studied relational

More information

Inverses and Elementary Matrices

Inverses and Elementary Matrices Inverses and Elementary Matrices 1-12-2013 Matrix inversion gives a method for solving some systems of equations Suppose a 11 x 1 +a 12 x 2 + +a 1n x n = b 1 a 21 x 1 +a 22 x 2 + +a 2n x n = b 2 a n1 x

More information

1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.

1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018. New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of

More information

CSE 303: Database. Outline. Lecture 10. First Normal Form (1NF) First Normal Form (1NF) 10/1/2016. Chapter 3: Design Theory of Relational Database

CSE 303: Database. Outline. Lecture 10. First Normal Form (1NF) First Normal Form (1NF) 10/1/2016. Chapter 3: Design Theory of Relational Database CSE 303: Database Lecture 10 Chapter 3: Design Theory of Relational Database Outline 1st Normal Form = all tables attributes are atomic 2nd Normal Form = obsolete Boyce Codd Normal Form = will study 3rd

More information

Section 1 (closed-book) Total points 30

Section 1 (closed-book) Total points 30 CS 454 Theory of Computation Fall 2011 Section 1 (closed-book) Total points 30 1. Which of the following are true? (a) a PDA can always be converted to an equivalent PDA that at each step pops or pushes

More information

Problems and Solutions

Problems and Solutions 46 th Canadian Mathematical Olympiad Wednesday, April 2, 204 Problems and Solutions. Let a, a 2,..., a n be positive real numbers whose product is. Show that the sum a a 2 + + a ( + a )( + a 2 ) + a 3

More information

Design Theory for Relational Databases

Design Theory for Relational Databases Design Theory for Relational Databases FUNCTIONAL DEPENDENCIES DECOMPOSITIONS NORMAL FORMS 1 Functional Dependencies X ->Y is an assertion about a relation R that whenever two tuples of R agree on all

More information

Quantum Computing Lecture 2. Review of Linear Algebra

Quantum Computing Lecture 2. Review of Linear Algebra Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces

More information

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r n r t d n 20 22 0: T P bl D n, l d t z d http:.h th tr t. r pd l 0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n.

More information

Database Design: Normal Forms as Quality Criteria. Functional Dependencies Normal Forms Design and Normal forms

Database Design: Normal Forms as Quality Criteria. Functional Dependencies Normal Forms Design and Normal forms Database Design: Normal Forms as Quality Criteria Functional Dependencies Normal Forms Design and Normal forms Design Quality: Introduction Good conceptual model: - Many alternatives - Informal guidelines

More information

On Independence and Determination of Probability Measures

On Independence and Determination of Probability Measures J Theor Probab (2015) 28:968 975 DOI 10.1007/s10959-013-0513-0 On Independence and Determination of Probability Measures Iddo Ben-Ari Received: 18 March 2013 / Revised: 27 June 2013 / Published online:

More information

Connectivity of addable graph classes

Connectivity of addable graph classes Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke January 8, 007 A non-empty class A of labelled graphs that is closed under isomorphism is weakly addable if for each graph

More information

Connectivity of addable graph classes

Connectivity of addable graph classes Connectivity of addable graph classes Paul Balister Béla Bollobás Stefanie Gerke July 6, 008 A non-empty class A of labelled graphs is weakly addable if for each graph G A and any two distinct components

More information

Intrinsic products and factorizations of matrices

Intrinsic products and factorizations of matrices Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences

More information

Introduction to Data Management. Lecture #6 (Relational Design Theory)

Introduction to Data Management. Lecture #6 (Relational Design Theory) Introduction to Data Management Lecture #6 (Relational Design Theory) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements v HW#2 is

More information

Phys 201. Matrices and Determinants

Phys 201. Matrices and Determinants Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1

More information

Relational Design: Characteristics of Well-designed DB

Relational Design: Characteristics of Well-designed DB Relational Design: Characteristics of Well-designed DB 1. Minimal duplication Consider table newfaculty (Result of F aculty T each Course) Id Lname Off Bldg Phone Salary Numb Dept Lvl MaxSz 20000 Cotts

More information

α-acyclic Joins Jef Wijsen May 4, 2017

α-acyclic Joins Jef Wijsen May 4, 2017 α-acyclic Joins Jef Wijsen May 4, 2017 1 Motivation Joins in a Distributed Environment Assume the following relations. 1 M[NN, Field of Study, Year] stores data about students of UMONS. For example, (19950423158,

More information

Lossless Joins, Third Normal Form

Lossless Joins, Third Normal Form Lossless Joins, Third Normal Form FCDB 3.4 3.5 Dr. Chris Mayfield Department of Computer Science James Madison University Mar 19, 2018 Decomposition wish list 1. Eliminate redundancy and anomalies 2. Recover

More information

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v ll f x, h v nd d pr v n t fr tf l t th f nt r n r

More information

MATH1050 Greatest/least element, upper/lower bound

MATH1050 Greatest/least element, upper/lower bound MATH1050 Greatest/ element, upper/lower bound 1 Definition Let S be a subset of R x λ (a) Let λ S λ is said to be a element of S if, for any x S, x λ (b) S is said to have a element if there exists some

More information

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th n r t d n 20 2 :24 T P bl D n, l d t z d http:.h th tr t. r pd l 4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n

More information

Determinants of Partition Matrices

Determinants of Partition Matrices journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised

More information

FUNCTIONAL DEPENDENCY THEORY II. CS121: Relational Databases Fall 2018 Lecture 20

FUNCTIONAL DEPENDENCY THEORY II. CS121: Relational Databases Fall 2018 Lecture 20 FUNCTIONAL DEPENDENCY THEORY II CS121: Relational Databases Fall 2018 Lecture 20 Canonical Cover 2 A canonical cover F c for F is a set of functional dependencies such that: F logically implies all dependencies

More information

,. *â â > V>V. â ND * 828.

,. *â â > V>V. â ND * 828. BL D,. *â â > V>V Z V L. XX. J N R â J N, 828. LL BL D, D NB R H â ND T. D LL, TR ND, L ND N. * 828. n r t d n 20 2 2 0 : 0 T http: hdl.h ndl.n t 202 dp. 0 02802 68 Th N : l nd r.. N > R, L X. Fn r f,

More information

Today s topics. Binary Relations. Inverse Relations. Complementary Relations. Let R:A,B be any binary relation.

Today s topics. Binary Relations. Inverse Relations. Complementary Relations. Let R:A,B be any binary relation. Today s topics Binary Relations Relations Kinds of relations n-ary relations Representations of relations Reading: Sections 7.-7.3 Upcoming Upcoming Minesweeper Let A, B be any sets. A binary relation

More information

Topics in Probabilistic and Statistical Databases. Lecture 9: Histograms and Sampling. Dan Suciu University of Washington

Topics in Probabilistic and Statistical Databases. Lecture 9: Histograms and Sampling. Dan Suciu University of Washington Topics in Probabilistic and Statistical Databases Lecture 9: Histograms and Sampling Dan Suciu University of Washington 1 References Fast Algorithms For Hierarchical Range Histogram Construction, Guha,

More information

Data Bases Data Mining Foundations of databases: from functional dependencies to normal forms

Data Bases Data Mining Foundations of databases: from functional dependencies to normal forms Data Bases Data Mining Foundations of databases: from functional dependencies to normal forms Database Group http://liris.cnrs.fr/ecoquery/dokuwiki/doku.php?id=enseignement: dbdm:start March 1, 2017 Exemple

More information

arxiv: v1 [math.gm] 2 Jun 2018

arxiv: v1 [math.gm] 2 Jun 2018 ON THE FACTORIZATION OF TWO ADJACENT NUMBERS IN MULTIPLICATIVELY CLOSED SETS GENERATED BY TWO ELEMENTS C.P. ANIL KUMAR arxiv:806.03344v [math.gm] 2 Jun 208 Abstract. For two natural numbers < p < p 2,

More information

Exercises 1 - Solutions

Exercises 1 - Solutions Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note

More information

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l

More information

Denotational Semantics

Denotational Semantics 5 Denotational Semantics In the operational approach, we were interested in how a program is executed. This is contrary to the denotational approach, where we are merely interested in the effect of executing

More information

H NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f

More information

Graph Transformations T1 and T2

Graph Transformations T1 and T2 Graph Transformations T1 and T2 We now introduce two graph transformations T1 and T2. Reducibility by successive application of these two transformations is equivalent to reducibility by intervals. The

More information

CS54100: Database Systems

CS54100: Database Systems CS54100: Database Systems Keys and Dependencies 18 January 2012 Prof. Chris Clifton Functional Dependencies X A = assertion about a relation R that whenever two tuples agree on all the attributes of X,

More information

DECOMPOSITION & SCHEMA NORMALIZATION

DECOMPOSITION & SCHEMA NORMALIZATION DECOMPOSITION & SCHEMA NORMALIZATION CS 564- Spring 2018 ACKs: Dan Suciu, Jignesh Patel, AnHai Doan WHAT IS THIS LECTURE ABOUT? Bad schemas lead to redundancy To correct bad schemas: decompose relations

More information

Chapter 10. Normalization Ext (from E&N and my editing)

Chapter 10. Normalization Ext (from E&N and my editing) Chapter 10 Normalization Ext (from E&N and my editing) Outline BCNF Multivalued Dependencies and Fourth Normal Form 2 BCNF A relation schema R is in Boyce-Codd Normal Form (BCNF) if whenever an FD X ->

More information

P = 1 F m(p ) = IP = P I = f(i) = QI = IQ = 1 F m(p ) = Q, so we are done.

P = 1 F m(p ) = IP = P I = f(i) = QI = IQ = 1 F m(p ) = Q, so we are done. Section 1.6: Invertible Matrices One can show (exercise) that the composition of finitely many invertible functions is invertible. As a result, we have the following: Theorem 6.1: Any admissible row operation

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then

More information

Functional Dependency Theory II. Winter Lecture 21

Functional Dependency Theory II. Winter Lecture 21 Functional Dependency Theory II Winter 2006-2007 Lecture 21 Last Time Introduced Third Normal Form A weakened version of BCNF that preserves more functional dependencies Allows non-trivial dependencies

More information

Introduction to Data Management CSE 344

Introduction to Data Management CSE 344 Introduction to Data Management CSE 344 Lecture 18: Design Theory Wrap-up 1 Announcements WQ6 is due on Tuesday Homework 6 is due on Thursday Be careful about your remaining late days. Today: Midterm review

More information

The coincidence Nielsen number for maps into real projective spaces

The coincidence Nielsen number for maps into real projective spaces F U N D A M E N T A MATHEMATICAE 140 (1992) The coincidence Nielsen number for maps into real projective spaces by Jerzy J e z i e r s k i (Warszawa) Abstract. We give an algorithm to compute the coincidence

More information

Properties of Context-free Languages. Reading: Chapter 7

Properties of Context-free Languages. Reading: Chapter 7 Properties of Context-free Languages Reading: Chapter 7 1 Topics 1) Simplifying CFGs, Normal forms 2) Pumping lemma for CFLs 3) Closure and decision properties of CFLs 2 How to simplify CFGs? 3 Three ways

More information

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications Yongge Tian China Economics and Management Academy, Central University of Finance and Economics,

More information

ϕ : Z F : ϕ(t) = t 1 =

ϕ : Z F : ϕ(t) = t 1 = 1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical

More information

Version January Please send comments and corrections to

Version January Please send comments and corrections to Mathematical Logic for Computer Science Second revised edition, Springer-Verlag London, 2001 Answers to Exercises Mordechai Ben-Ari Department of Science Teaching Weizmann Institute of Science Rehovot

More information

On the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges

On the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges On the Limiting Distribution of Eigenvalues of Large Random Regular Graphs with Weighted Edges Leo Goldmakher 8 Frist Campus Ctr. Unit 0817 Princeton University Princeton, NJ 08544 September 2003 Abstract

More information

Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and

Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and Copyright is owned by the Author of the thesis. Permission is given for a copy to be downloaded by an individual for the purpose of research and private study only. The thesis may not be reproduced elsewhere

More information

OQ4867. Let ABC be a triangle and AA 1 BB 1 CC 1 = {M} where A 1 BC, B 1 CA, C 1 AB. Determine all points M for which ana 1...

OQ4867. Let ABC be a triangle and AA 1 BB 1 CC 1 = {M} where A 1 BC, B 1 CA, C 1 AB. Determine all points M for which ana 1... 764 Octogon Mathematical Magazine, Vol. 24, No.2, October 206 Open questions OQ4867. Let ABC be a triangle and AA BB CC = {M} where A BC, B CA, C AB. Determine all points M for which 4 s 2 3r 2 2Rr AA

More information

CS322: Database Systems Normalization

CS322: Database Systems Normalization CS322: Database Systems Normalization Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Introduction The normalization process takes a relation schema through

More information

Difference Sets are Not Multiplicatively Closed

Difference Sets are Not Multiplicatively Closed DISCRETE ANALYSIS, 2016:17, 21 pp. www.discreteanalysisjournal.com arxiv:1602.02360v4 [math.nt] 3 Oct 2016 Difference Sets are Not Multiplicatively Closed Shkredov, I. D. Received 16 February 2016; Published

More information