Problem 3. Discretize attributes A and B in the Decision Table T. {A, B) are classification attributes. D is the decision attribute. B X x1 x2 x3 x4 x5 x6 A 1 1 5 3 8 3 3 5 5 8 3 5 Decision Table T Solution : Dom(A) 13 59 Dom(B): 358 p1 p2 p3 q1 q2 D 2 2 2 1 1 1

Problem 3. Discretize attributes A and B in the Decision Table T. {A, B) are classification attributes. D is the decision attribute. B X x1 x2 x3 x4 x5 x6 A 1 1 5 3 8 3 3 5 5 8 3 5 Decision Table T Solution : Dom(A) 13 59 Dom(B): 358 p1 p2 p3 q1 q2 D 2 2 2 1 1 1

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

Related questions

Q: Consider the following preference profile P: Applicant Preferences Hospital Preferences H4 H2 H3 H3…

Q: Consider the relation schemas R(A,B) and S(A,B). Suppose {A } is the key for R and also the key for…

A: Even though {A} is the key for both R and S, the union of R and S has the complete keyset, so here…

Q: the primary key for R, and every tuple in R matches 5 tuples in S There exists a primary index on…

A: The relation is explained as,

Q: B D 3 1 2

A: Classification is a two-step process, learning step and prediction step, in machine learning. In the…

Q: Suppose relation R (x, y, z, w) has no tuples. Consider the trigger: CREATE TRIGGER T AFTER INSERT…

A: Answer to the above question is in step2.

Q: 3. Disprove the following rule: {B > CD, AB → E, E → C} |= {AE → CD} To disprove a rule, construct a…

Q: Consider the following functional dependencies for a relation R(A, B, C, D) A -> (B, C, D), (A, D)…

A: Given relation with functional dependencies is: R(A, B, C, D) A -> (B, C, D), (A, D) -> (B, C)…

Q: 3. Meaning of FD Consider R= (ABCDE), F = {A>BC, CD→E, B→ D, E → A}. Assume the domains of all…

A: Given, R = (ABCDE) A→BC CD→E B→D E→A The domain of all attributes are integers

Q: If the relation r has x tuples and relation s has y tuples, how many tuples are in r x s? A) x + y…

A: The answer is

Q: [A, B, C, D, E, F, G, H, I, J, K, L, M, N] B, C} → {D, E} {A, B, C, G} M} → {G, H, I, J} > {K, G}

Q: Given relations P and Q, both over attributes A and B, write a query in relational algebra under bag…

A: Q is always contained in the answer to P.

Q: If all parameters need to be optimized, which of the models can use Goal Seek to optimize? a.…

A: In Excel software, Goal Seek is used to determine the value of cell that is used as input in the…

Q: 5 A 1 R 4 6 B 2 6 8 B 4 9 7 с 5 The full outer join has 3 NULLS. he left outer join has 4 NULLS. S…

A: In this question two tables are given as the R and SIt is asked to perform full outer joinright…

Q: Consider the relation employee(name, supervisorName, sex) with name as the primary key.…

Q: Given U = {all attribute blocks}, design two sets A and B such that A union B equals to A

A: GIVEN U ={all attribute blocks} to proof sets AUB=A let, all attributes will be represented as:-…

Q: 7. Write an algorithm that receives as input the matrix of a relation R and produces as output the…

A: Answer :-

Q: Could you tell a step by step procedure of finding a super key for A relation R(A,B,C,D, E) having…

A: Solution - In the given question, we have to find the super key of the given relation R(A,B,C,D,E).…

Q: Question 6. Consider the relation R(ABCDE) and its functional dependencies set {AB->C, C->E, B-> D,…

A: Answer of the given question: choice (d) is the correct answer. Lossless Decomposition: Lossless…

Q: Question 3: Using the traceability matrix below answer the following questions: Traceable item T1 T2…

A: According to Bartleby guidelines, we as expert are required to answer only one question in case of…

Q: a discount policy: An insurance company has a policy of discounting its product to customers under…

A: step wise step statements in decision tree for the above context

Q: Let W(A, B) and Q(C,D) be two relation schemas. Let r₁ and r2 be the corresponding relation…

A: In the Referential integrity constraints, if a foreign key in table 1 refers to the primary key of…

Q: Write a program to create the following simulated dataset a) make_regression: For linear regression…

A: Algorithm:Generate a linear regression dataset using sci-kit-learn's make_regression.Print the…

Q: id name supervisor A John Joyce Jim Jennifer Peter D null E C E Write an SQL statement to list any…

A: We can achieve the desired result by doing self join of the Employee table

Q: Consider the universal relation R (A, B, C, D, E, F, G} and the set %3! of functional dependencies F…

A: The Relation given is : R = { A, B, C,D ,E, F, G} And the functional dependencies are: B,C --> A…

Q: can be converted to a strong entity set by simply adding the appropriate attributes. Why,

A: For the following reasons, a weak entity set is required:

Q: Consider the following parameters of a relation r (A, B, C) in which A be the primary key. nr =…

A: Answer: I have given answered in the handwritten format

Q: Given the reation R (A, B, C, D , E), with functional dependencies: A, B -> C D, E -> C B -> D…

A: We have a relation R(A,B,C,D,E) and we have to decompose it into BCNF and check dependency…

Q: a) Given the set of transactions in the table, compute the support for itemsets {e}, {b, d), and (b,…

A: To computе thе support for itеmsеts {е}, {b, d}, and {b, d, е}, wе count thе numbеr of…

Q: 1.A known relationship mode of R (U, F), U= (A, B, C, D, E, G); F={AB->C, D->EG, C->A, BE->C, BC->D,…

A: F= AB->C, D-> EG, C-> A, B -> C, BC ->D, CG->BD, ACD->B, CE->AG 1) let's…

Q: There are two alternative methods of representing an employee’s optional (single) phone number. The…

A: An element type ought to have a key characteristic which exceptionally recognizes every element in…

Q: Q1: All the following statements about weak and strong entity sets are True, Except: Select one:…

A: Note:- As per our guidelines, we are allowed to answer the first question of multiple question.…

Q: Consider the following functional dependencies that hold on R(ABCDEF): AB-> CD, E -> C, B -> EF Is…

A: Dear Student, The answer to your question is given below -

Q: The Database contains 4 transactions. Find the association rules exact from these set using Apriori,…

A: Transaction A B C D E K 001 1 1 0 1 0 1 002 1 1 1 1 1 0 003 1 1 1 0 1 0 004 1 1 0 1 0 0

Q: Consider the universal relation: R = (A, B, C, D, E, F, G, H, I, J) and the set of functional…

A: A crucial step in relational database architecture is database normalization, which entails breaking…

Q: Let A1, A2, and A3 be attributes in a relation R. If both of these functional dependencies hold: A1…

Question

Problem 3. Discretize attributes A and B in the Decision Table T. (A, B) are classification attributes. D is the decision attribute.
B
X
x1
x2
x3
x4
x5
x6
A
1
1
5
3
8
3
3
5
5
8
3
5
Decision Table T
Solution : Dom(A) 13 59 Dom(B): 358
pl p2 p3 q1 q2
D
2
2
2
1
1
1

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Select the following relations on Z that are reflexive. {(a, b) | ab >0} {(a, b) | a>b-1} {(a,b) a² > b} 2 {(a,b) | a² = b² (mod 7)}
Consider the following scenario: you have a relation that contains x, y coordinates, and the names of eateries. Assume, further, that the only questions that will be asked will be of the following types. The query specifies a location and inquires as to whether or not there is a restaurant located exactly at that location. If you were to choose between R-Tree and B-tree, which one would you choose? Why?
Assuming functional dependency A-->B holds, which of the following functional dependencies may not necessarily be true for some attribute X? O AX -> BX O All of the other options must be true O AX -- B O A> AX
6. In Dynamic Programming, the most important issues are defining subproblems and identifying recurrence relations. The most important issues in Dynamic Programming are defining subproblems and identifying recurrence relations. When a problem arises Describe your view of these problems as they arise.
J 1 Let R(A, B, C, D, E, F) be a relation schema, and let S = {A → B, BC → D, E → C, D →A, B → D} be a set of functional dependencies. Use the Nonadditive Join Test for Binary Decomposition to determine if the following decomposition is lossless.
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.
1. A known relationship mode of R (U, F), U= (A, B, C, E, F, G, H, I, J, G); F={AB->E,ABE->FG, B->FI, C->J, CJ->I, G->H}; find the minimum cover of F, then use theNormal Form decomposition algorithm to decompose this mode to 3NF, and check if thedecomposition has the nonadditive join property.
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.
Suppose you are given a relation r(a, b, c). a. Give an example of a situation under which the performance of equality selection queries on attribute a can be greatly affected by how r is clustered. b. Suppose you also had range selection queries on attribute b. Can you cluster r in such a way that the equality selection queries on r.a and the range selection queries on r.b can both be answered efficiently? Explain your answer. c. If clustering as above is not possible, suggest how both types of queries can be executed efficiently by choosing appropriate indices.