Given relations PROJ and ASG in Fig. 2.2 in our textbook, let p1: LOC ≤ "New York" and p2: LOC> "New York" be two simple predicates. Assume that character strings have anorder among them, based on the alphabetical order. Perform a horizontal fragmentation of PROJ with respect to these predicates to obtain PROJ1 and PROJ2. Using thefragmentation of PROJ, perform further derived horizontal fragmentation for ASG. Place each row of ASG, (1) to (10), under the appropriate fragment.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)ASG1ASGENO PNOP1IINKINNIXE1E2 P1E2E3E3E4E5 P2E6 P4 Manager(6)P2P3P4P2RESPPossible answers122461048Programmer 18Manager24483640E7 P3 EngineerE8 P3 ManagerManagerAnalystAnalystConsultantEngineerDUR(9)No Answers Chosen(3)(1)(4)(10)ASG2(5)(7)(8)No Answers Chosen(2)IT EMPENOE1E2E3E4E5E6E7E8ENAMEJ. DoeM. SmithA. LeeJ. MillerB. CaseyL. ChuR. DavisJ. JonesTITLEElect. Eng.Syst. Anal.Mech. Eng.ProgrammerSyst. Anal.Elect. Eng.Mech. Eng.Syst. Anal.PROJPNOP1P2 Database Develop.P3CAD/CAMP4MaintenancePNAMEInstrumentationBUDGET150000135000250000310000ASGENOPNOE1 P1E2P1E2 P2E3P3E3P4E4P2E5 P2E6 P4E7 P3E8P3LOCMontrealNew YorkNew YorkParisPAYRESPManagerAnalystAnalystConsultantEngineerProgrammerManagerManagerEngineerManagerTITLEElect. Eng.Syst. Anal.Mech. Eng.ProgrammerDUR1224610481824483640SAL40000340002700024000

Let's do the predicts p1 = LOC <= "New York" p2 = LOC > "New York"

siven relations PRO New York and pz: in Fig. 2.2 in our textbook, "New York be two simple predic edicates. Assu that aracter strings have an order among them, based on the alphabetical order. Perform a horizontal fragmentation of PROJ with respect to these predicates to obtain PROJ1 and PROJ2. Using the fragmentation of PROJ, perform further derived horizontal fragmentation for ASG. Place each row of ASG, (1) to (10), under the appropriate fragment. (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) ASG ENO PNO RESP -~~**** E1 P1 E2 P1 E2 P2 E3 P3 E3 P4 E4 P2 E5 P2 P4 E6 Manager Analyst Analyst Consultant Manager Manager E7 P3 Engineer P3 Manager E8 DUR 12 24 6 10 48 Engineer Programmer 18 24 48 36 40

siven relations PRO New York and pz: in Fig. 2.2 in our textbook, "New York be two simple predic edicates. Assu that aracter strings have an order among them, based on the alphabetical order. Perform a horizontal fragmentation of PROJ with respect to these predicates to obtain PROJ1 and PROJ2. Using the fragmentation of PROJ, perform further derived horizontal fragmentation for ASG. Place each row of ASG, (1) to (10), under the appropriate fragment. (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) ASG ENO PNO RESP -~~**** E1 P1 E2 P1 E2 P2 E3 P3 E3 P4 E4 P2 E5 P2 P4 E6 Manager Analyst Analyst Consultant Manager Manager E7 P3 Engineer P3 Manager E8 DUR 12 24 6 10 48 Engineer Programmer 18 24 48 36 40

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

Suppose propositional sentences and knowledge-base here. We have a knowledge-base called KB. KBPrime is defined as an union of (1) KB and (2) the negation of a propositional predicate P. Answer true/false to the following questions. Note that "|=" is used to denote entailment, and "|-" is used to denote derivation through resolution. a) If KB |= P, then KB |- P. That is, if KB entails P, then KB derives (using resolution) P. b) If KB |- P, then KB |= P. c) If KBPrime |- [], then KBPrime is not satisfiable. d) If KBPrime is not satisfiable, then KBPrime |- [].
Mathematical Logic. First-order or predicate logic. For each of the following relations, give a formula that defines it in (N;+,∙). The language has equality and has the parameters ∀,+ and ∙. a) {0} b) {1} c) {〈m,n〉| n is the successor of m in N} d) {〈m,n〉| n<n in N} Please be as clear as possible. Thank you.
Using the symbolization key given, translate each English-Language sentence into SL.M: Those beings are men in pajamasL: Those beings are lymers O: Those beings are orangutans 1) Those beings are neither orangutans nor lymers.2) If those beings are lymers, then they are neither orangutans nor men in pajamas.3) Unless those beings are men in pajamas, they are either lymers or they are orangutans.
Given: Relation R = {(a,a), (a.b), (b,a). (b,b). (c,c)} and Set S = {a, b, c} Complete Relation R to be Transitive with Set S
Is each of the following statements true or false? Please explain. a. If a signature σ is infinite (i.e. contains infinitely many symbols), then a σ-formula can have infinite length. b. Let σ := (c, f, ·, <) be a signature, where c is a contant symbol, f is a unary operation symbol, · is a binary operation symbol, and < is a binary relation symbol. Then ϕ(y, z) := ∀x(f(x) · c < x) is an extended σ-formula whose interpretation in each σ-structure is a binary relation. c. For any signature σ and any σ-structure A := (A, σA), if a set D ⊆ Ak is definable (A-definable here), then it is P-definable for some finite P ⊆ A.
Redundant Inequalities:prove statementLet e1, e2 be two symbolic expressions defined in V ∪P and q ∈ V ∪P.c1, c2 are two inequalities of I such that c1 is defined by e1 REL q and c2 by e2 REL q. REL is an inequality relationship in {≤, <}. Then c2 can be eliminated from I, iff low(e1 − e2) ≥ 0.
Make a one-of-a-kind regular expression using it. Your regular expression has to have all three operators in order to work for regular languages (union, concatenation, Kleene star). Construct an NFA from your regular expression by using the procedure outlined in Kleene's theorem part 1 for constructing. Verify that every operator has properly converted their structural components, which ought to be maintained in the NFA (with the exception of the elimination of null transitions between the concatenation of single symbol NFAs)
(4) Discrete Structure: Solve it on urgent basis: Question # 4: Let P(x) be the statement “x can speak Russian” and let Q(x) be the statement “x knows the computer languageC++.” Express each of these sentences in terms of P(x), Q(x), quantifiers, and logical connectives. The domainfor quantifiers consists of all students at your school. a). There is a student at your school who can speak Russian and who knows C++. b). There is a student at your school who can speak Russian but who doesn’t know C++. c). Every student at your school either can speak Russian or knows C++. d). No student at your school can speak Russian or knows C++.
8. Let the universe of discourse be U = {−2,−1, 0, 1, 2}. Compute the negations for each of thefollowing statements, via transforming the negation connectives inward, such that the negationsymbols immediately precede predicates. Thereafter, determine whether each of the negatedstatement is true or false. Note that x and y range over U.(a) ∀x∃y(x + y = 1).(b) ∃x∀y(x + y = −y).(c) ∀x∃y(xy ≥ y).(d) ∃x∀y(x ≤ y).
Let P(x) and Q(x) be relations, with x a variable from a given domain of discourse U. The Axiom of the Hilbert deductive system for first-order logic applied below is "Axiom 1,2,3,4,5" ? ⊢ ∀x P(x) → (∃x Q(x) → ∀x P(x)) Consider the steps given below of a proof in the Hilbert deductive system and determine the reason that justifies each. ∀x A(x) ⊢ ∀x A(x) "?"∀x A(x) ⊢ ∀x A(x) → A(a) " ?"∀x A(x) ⊢ A(a) " ?"
We are given the following corpus, modified from the one in the chapter: <s> I am Sam </s> <s> Sam I am </s> <s> I am Sam </s> <s> I do not like green eggs and Sam </s>
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.