Let R be a relation on A = {0, 1, 6, 8} and R = {(0, 0), (8, 6), (6, 6), (8, 8), (1, 1), (1, 0), (0, 1)}. Are the following statements true or false? 1. R is symmetric ? ? ? ? ? ? V v 2. R is transitive 3. R is reflexive 4. R is an equivalence relation 5. R is anti-symmetric V 6. R is a partial order

Let R be a relation on A = {0, 1, 6, 8} and R = {(0, 0), (8, 6), (6, 6), (8, 8), (1, 1), (1, 0), (0, 1)}. Are the following statements true or false? 1. R is symmetric ? ? ? ? ? ? V v 2. R is transitive 3. R is reflexive 4. R is an equivalence relation 5. R is anti-symmetric V 6. R is a partial order

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following four sets where the domain is the set of positive integers. A = { x | x is a positive integer less than 10} B= {x|x is a prime number less than 10} C= {x|x is an even number less than 10} D= {x|x is a power of 2} Answer the following questions (1) What is AU B|? (2) What is P(A N C)? (3) What is | P((AU C)- (CU D))|?
1) Consider the following relation instance of R1(A, B, C) contains the tuples {(a1,b1.c1). (a2,b1,c1), (a3,b3,c3), (a4,b3,c3), (a5,b5.c5). (a6,b6,c6)} and S1(B, C, D, E) contains the tuples ((b1.c1,d1,e1), (b1.c1.d2.e2),.(b1.c1,d3,e3), (b2.c2,d2.e2), (b3,c3,d4,e4).(b6.c7.d8,e9)) The following SQL query will result in how many tuples? Select From R1 r LEFT OUTER JOIN S1 s (ON r.B= s.B AND r.C=s.C): (The answer will simply be an integer, like 25). Answer: 2) Consider a relation schema R = (A, B, C, D, E, F, G} with the following set of functional dependencies: F = (BG A, CGA, A BC, BC A, BD E, EF, CF B) The decomposition of R into R1 = (A, B, C, G), R2 = {B, D, E), R3 = (B, C, F) and R4 = (E, F) is O In BCNF but Not in 3NF. In 3NF but Not in BCNF. In 3NF and in BCNF. Not in 3NF and Not in BCNF 3)
Mention the reasons why a business would want and not want firewalls for physical security.
You are given a relation R with the following attributes R(A,B,C,D,E). Assume that you were given the following functional dependencies: • FD1= AB -> E • FD2: = D -> C (a) What is a valid key for this relation? justify your response. (b) Is this relation in 3NF (Third Normal Form)? Justify your response. If it is not in 3NF, normalize the relation and demonstrate all steps of normalization.
12. Consider the following relations on {1, 2, 3, 4}. R = {(2,2), (2,3),(2,4),(3,2),(3,3),(3,4)} R = {(1,1),(1,2).(2,1),(2,2).(3,3),(4,4)} R3 = {2,4),(4,2)} R4 = {(1,2),(2,3),(3,4)} R = {(1,1),(2,2),(3,3),(4,4)} a) Which of these relations are reflexive? Justify your answers. b) Which of these relations are symmetric? Justify your answers. c) Which of these relations are antisymmetric? Justify your answer. d) Which of these relations are transitive? Justify your answers.
Given the relations U and T below, use ordered pair notation to express the relation To U. a ToU = { Ex: (a, b), (b, c) b U a b T с
Let R be an equivalence relation on A = {0,5,7,9} and R = {(0, 9), (0, 5), (7, 7), (9, 5), (5,9), (9, 9), (5, 0), (0, 0), (9, 0), (5,5)}. Answer each of the following questions. (5) = 0 [9] = [0] = [7] =
For each of the following relations, determine whether the relation is: • Transitive. • A partial order. • A strict order. • An equivalence relation. Reflexive. Anti-reflexive. Symmetric. • Anti-symmetric. Justify all your answers. a. Ris a relation on the set of all people such that (a, b) e R if and only if a and b have a common grandparent. b. Ris a relation on Z such that (x, y) E R if and only if |x – y| < 2. c. Ris a relation on Z* such that (x, y) E R if and only if x is divisible by y. Hint: An integer x is divisible by an integer y with y # 0 if and only if there exists an integer k such that x = yk. d. Ris a relation on Z* such that (x, y) E R if and only if there is a positive integer n such that x" = y. e. Ris a relation on Z x Z such that ((a, b), (c, d)) E R if and only if a < c and b < d.
FInd the relation R that induces the following partition of set A: {{1,5},{2,3,6}, {4}}.
! Exercise 2.5.3: Suppose R and S are two relations. Let C be the referen- tial integrity constraint that says: whenever R has a tuple with some values Vr , V2, . . . , Un in particular attributes A1, A2,... , An, there must be a tuple of S that has the same values v1, v2,. .. , Vn in particular attributes B1, B2,... , Bn. Show how to express constraint C in relational algebra.
QUESTION 3 The domain for the relation R is the set of all integers. For any two integers, x and y, xRy if x evenly divides y. An integer x evenly divides y if there is another integer n such that y = xn. (Note that the domain is the set of all integers, not just positive integers.) Anti-symmetric Reflexive Symmetric Transitive