Define relations R₁,..., R6 on {1, 2, 3, 4} by R₁ = {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3,4)}, R2= {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4,4)}, R3= {(2, 4), (4, 2)}. R₁ = {(1, 2), (2, 3), (3,4)}, R5 = {(1, 1), (2, 2), (3, 3), (4,4)}, R6 = {(1, 3), (1,4), (2, 3), (2, 4), (3, 1), (3,4)}, Which of the following statements are correct? Check ALL correct answers below. A. R3 is transitive B. R4 is antisymmetric C. R5 is transitive D. R₁ is reflexive E. R4 is transitive F. R5 is not reflexive G. R₂ is not transitive H. R4 is symmetric I. R3 is reflexive J. R₂ is reflexive K. R3 is symmetric L. R₁ is not symmetric M. Ro is symmetric

Define relations R₁,..., R6 on {1, 2, 3, 4} by R₁ = {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3,4)}, R2= {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4,4)}, R3= {(2, 4), (4, 2)}. R₁ = {(1, 2), (2, 3), (3,4)}, R5 = {(1, 1), (2, 2), (3, 3), (4,4)}, R6 = {(1, 3), (1,4), (2, 3), (2, 4), (3, 1), (3,4)}, Which of the following statements are correct? Check ALL correct answers below. A. R3 is transitive B. R4 is antisymmetric C. R5 is transitive D. R₁ is reflexive E. R4 is transitive F. R5 is not reflexive G. R₂ is not transitive H. R4 is symmetric I. R3 is reflexive J. R₂ is reflexive K. R3 is symmetric L. R₁ is not symmetric M. Ro is symmetric

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

Implement in Python / Java Algorithm: Testing for lossless (nonadditive) join property. Input: A universal relation R, a decomposition D = { R1, R2, R3, ….. Rm } of R, and a set F of functional dependencies. 1. Create an initial matrix S with one row i for each relation in Ri in D, and one column j for each attribute Aj in R. 2. Set S(i, j) := bij for all matrix entries. (* each bij is a distinct symbol associated with indices (i, j) * ) {for each column j representing attribute Aj {if (relation Ri includes attribute Aj ) then set S(I, j):=aj;};}; (* each aj is a distinct symbol associated with index (j) *) 3. For each row i representing relation schema Ri {for each functional dependency X → Y in F {for all rows in S which have the same symbols in the columns corresponding to attributes in X {make the symbols in each column that correspond to an attribute in Y be…
The reflexive and transitive closure of the relation A = {(0,1),(1,2)} on B = {0,1,2} is {(0,1),(1,0),(1,2),(2,1)} {(0,0),(1,1),(2,2)} {(0,1), (1,2)} {(0,1),(0,2),(1,2)} {(0,2)} {(0,0),(0,1),(0,2),(1,0),(1,1),(1,2),(2,0),(2,1),(2,2)} {(0,0),(0,1),(0,2),(1,1),(1,2),(2,2)}
Find equivalence classes of following relations if they exist. a) {(0, 0), (1, 1), (2, 2), (3, 3)} b) {(0, 0), (0, 2), (2, 0), (2, 2), (2, 3), (3, 2), (3, 3)} c) {(0, 0), (1, 1), (1, 2), (2, 1), (2, 2), (3, 3)} d) {(0, 0), (1, 1), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} e) {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 2), (3, 3)}
Suppose R is a relation with attributes A1, A2, ..., An. As a function of n, tell how many superkeys R has, if The only keys are A1 and A2?
Consider a relation schema R(A,B,C,D,E,H,G) F = {A->BC, B->C, C->BED, BD-> E, E->D, AG->E, G->H, AH->G} 3NF decomposition of r
Computer Science Given the relation R (A, B, C, D, E, F, G) and the set of functional dependencies: F= {BCD → A, BC → E, A → F, F→G, C→D, A→G}, a) Decompose R into 3NF. Show the different steps. b) Is this decomposition also in BCNF? Why or why not?
Consider the relation R = {(1, 2),(2, 1),(2, 3),(3, 4),(4, 1)} on {1, 2, 3, 4}. Is R transitive? Explain.
Show that the following decomposition of the schema R of Exercise 7.1 is not alossless decomposition:(A, B, C)(C, D, E).Hint: Give an example of a relation r(R) such that ΠA, B, C (r) ⋈ ΠC, D, E (r) ≠ r
NO CHAT GPT, ONLY HAND WRITTEN Suppose we have a relation R(A,B,C) with an MVD A ↠ B. If we know that the tuples (a, b1, c1), (a, b2, c2) and (a, b3, c3) are in the instance current of R, what other tuples we know must also be in R. Answer preferably in LaTeX if possible
Let a bus timetable be represented by a list of routes where each route is repre- sented by Start/End/DepatureTime/ArrivalTime. Both DepartureTime and ArrivalTime are represented by a relation time(Hour,Minutes). Write a Prolog relation journey(Start, End) that is true if there is a route in the timetable that can get a passenger from Startto End directly or any number of intermediate stops where there is at least 10 minutes between the arrival at an intermediate point before the departure of the next leg of the journey. Assume the clock is a 24 hour clock and all departure and arrival times occur within the same day.
Consider the relation R(O,P,X,Y,E, S); FDs={ O->P, XY->O, OE->S, EY->X, PY->X} What is the lossless (or nonadditive) join property of a decomposition? Why is it important? Determine whether each of the decompositions has the lossless join property with respect to F and conclude for the whole decomposition Determine whether each of the decompositions has the dependency preserving property with respect to FD and conclude for the whole decomposition
Consider the issue of interesting orders in optimization. Suppose you are given a query that computes the natural join of a set of relations S. Given a subset S1 of S, what are the interesting orders of S1?