Assignment 2.1Given a minimum support threshold of 1, please try to solve the following questions.a) Show the FP-Tree with the lexicographic ordering a, b, c, d, e, f for thefollowing database of transactions.TransID12345TransIDItemsa,b,c,db, c, e, fa,d,e,fb) Show the FP-tree for the same database with the reverse lexicographic ordering12345a,e,fb, d, fItemsd, c,b,af,e,c,bf,e,d, af,e,af,d,bWhy is the second FP-tree smaller, i.e. has fewer nodes?

Solution to the given question, Introduction: FP is frequent pattern algorithm. It is an efficient…

Assignment 2.1 Given a minimum support threshold of 1, please try to solve the following questions. a) Show the FP-Tree with the lexicographic ordering a, b, c, d, e, f for the following database of transactions. TransID 1 2 345 b) Show the FP-tree for the same database with the reverse lexicographic ordering TransID 1 GAWNI 2 3 4 Items a,b,c,d b, c, e, f a, d, e, f a, e, f b, d, f 5 Items d, c,b,a f,e,c,b f,e,d, a f,e,a f,d,b c) Why is the second FP-tree smaller, i.e. has fewer nodes?

Assignment 2.1 Given a minimum support threshold of 1, please try to solve the following questions. a) Show the FP-Tree with the lexicographic ordering a, b, c, d, e, f for the following database of transactions. TransID 1 2 345 b) Show the FP-tree for the same database with the reverse lexicographic ordering TransID 1 GAWNI 2 3 4 Items a,b,c,d b, c, e, f a, d, e, f a, e, f b, d, f 5 Items d, c,b,a f,e,c,b f,e,d, a f,e,a f,d,b c) Why is the second FP-tree smaller, i.e. has fewer nodes?

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

With the following Object Oriented Relational Database schema, select the attributes that a tuple in Teachers would have. create type Person (ID varchar(20) primary key, name varchar(20), address varchar(20)) ref from(ID); create table people of Person; create table students ( degree varchar (20)) inherits people ;create table teachers ( salary integer ) inherits people ; a. id b. salary c. degree d. name
True/False Questions Every relationship in an E-R diagram must translate to an individual relation in the relational model. Given an SQL query, there are often multiple ways of writing it in relational algebra. For any relation, it is possible to construct two separate unclustered indexes on different keys. Given a relation that is not in BCNF there is always a unique decomposition into relations that are in BCNF. B+ trees can include duplicate keys.
6. Let the following database schema be given. Person(idnumber, name, dob, mother, father) primary key idnumber foreign key father references Person(idnumber) foreign key mother references Person(idnumber) Consider the following query: For the person with idnumber 42 produce a list of all their ancestors. Note that ancestors include grandparents, great-grandparents and so on. (a) Outline how you would solve this task programmatically, ad- dressing which particular SQL shortcoming you have to over- come.
Consider a relational schema R = {A, B, C, D, E, G, H}, satisfying the functional dependencies F = {E → G, E → H, G → H, A → BC, BC → D, C → H, EG → A}. a) Derive all candidate keys for this schema. b) Derive a canonical cover of the functional dependencies in F. c) Is the above schema in BCNF? Prove or disprove. If it is not in BCNF, convert it into BCNF. d) Is the BCNF schema from (c) dependency-preserving? Prove or disprove. If not, convert into 3NF.
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.
Assume, for the sake of argument, that you have access to a database listing the addresses and names of all nearby restaurants. Only the following kind of questions are required: The question seeks to determine whether the given location is suitable for an eating establishment. When comparing B-tree vs R-tree indexing, which one is better and why? Why?
¡.Determine whether the below schedule is serializable or not with suitable justifications. Draw the precedence graph as well. ii. Consider the following relations employees (empld, emp_name, Cid, dept_name, designation, salary); company (Cid, company name, city); managers (managerld, mname, Cid, no-of-indoor-projects, outdoor-project-area) Write relational algebraic expression for the following queries: a. List the salary of employees from 'Accounts department order by employee name in ascending order. b. Display the manger names along with their company name whose outdoor-project area is 'Urban'.
Consider the transaction database in the table below: TID items_bought 1 {a, b, c, d} 2 {b, c, e, f} 3 {a, d, e, f} 4 {a, e, f} 5 {b, d, f} Show the prefix-based enumeration tree of frequent itemsets, for the data set of the table above at an absolute minimum support level of 2. Assume a lexicographic ordering of a, b, c, d, e, f.
Today almost every commercial database is based on O the hierarchical model O the linked-list model O the object-oriented model lists the relational model Given the relations: STUDENT (SID. StudentName, Major, AdvisorID) ADVISOR (AdvisorID, AdvisorName, Office, Phone) such that each student is assigned to one advisor, which of the following is true? O Major is a candidate key. O Phone is a candidate key. AdvisorName is a determinant. O AdvisorID is a foreign key. O SID is both a primary key and a foreign key.
For the relational algebra queries, you can cut and paste the following as needed into your answer: p subscript (A) σ subscript (A) A ⋈ subscript B ρ (A(1→stuff), B) A ∩ B A U B symbol subscript1 ≤ subscript2 ˄ subscript3 ≥ subscript4 ˅ subscript5 < > subscript6 Consider the following database schema: Flights(flno, from, to, distance) Aircraft(aid, aname, cruisingrange) Certified(eid, aid) Employees(eid, ename, salary) In the above schema, Employees describes all employees, while Certified represents the fact that a given employee is certified to fly a given aircraft. Thus, all employees who are pilots will be listed in Certified (and no other employees will). An aircraft is able to fly a given flight if the aircraft’s cruisingrange is at least as great as the flight’s distance. a) Express the following query in both (i) Relational Algebra and (ii) SQL: Find the departure airport (from) and arrival airport (to) of flights that are able…
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.
4. (a) Why is normalization important in database design? Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = { AB → C, A → DE, B → F, F → GH, D → IJ }.What is the key for R? Decompose R into 2NF (Second Normal Form) and then 3NF (Third Normal Form) relations. (b) Consider a relation schema R = (X, Y, Z) on which the following functional dependencies hold: { XY → Z, Z → X }. Show that the schema R is not in BCNF (Boyce-Codd Normal Form) but it is in 3NF (Third Normal Form).