Question1: Consider the following transactional database TDB containing 9 transactions: List of Items 11, 12, 15 12, 14 12, 13 11, 12, 14 11, 13 12, 13 11, 13 11, 12, 13, 15 11, 12, 13 ● TID T100 T200 T300 T400 T500 T600 T700 T800 T900 Using Apriori algorithm find all association rules with high confidence (minsup is set to 2/9 and minconf is set to 0.75)

Question1: Consider the following transactional database TDB containing 9 transactions: List of Items 11, 12, 15 12, 14 12, 13 11, 12, 14 11, 13 12, 13 11, 13 11, 12, 13, 15 11, 12, 13 ● TID T100 T200 T300 T400 T500 T600 T700 T800 T900 Using Apriori algorithm find all association rules with high confidence (minsup is set to 2/9 and minconf is set to 0.75)

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

Course: Data Mining Language: R (although it might not be needed for this question) Suppose you are given the data to analyze that includes a single attribute age. Following are the age values in unsorted order, 22 46 13 70 35 20 19 45 25 40 15 22 33 35 33 30 35 35 21 36 52 25 20 25 16 16 25 17 Use smoothing by bin means to smooth these data, using a bin depth of 4. Illustrate your steps. Use smoothing by bin boundaries to smooth these data, using a bin depth of 4. Illustrate your steps. How might you determine the outliers in the data?
One method of storing Big Data is within key-value pairs. Explain key-value pairs and give two scenarios in which the use of key-value pairs would be applicable?
Produce an example of a query for which each of the three partitioning approaches, namely round- robin, hash partitioning, and range partitioning, would provide the quickest result.
Suppose that in some database of people and their heights we count a person’s height as 1 unit of information. How much information is contained in the average of the heights of all the people in the database?
Suppose relations R(A,B) and S(B,C,D) are as follows: S 9 A 7 1 3 5 OC (4,4) O d. (7,9) R O a. (5, 6) O b. (1, 2) 2 4 6 B 8 2 B 4 6 8 с 1 7 AL 9 4 9 Compute the result of the query: SELECT R.A, X FROM R, (SELECT B, SUM(C) AS X FROM S GROUP BY B) AST D 1 2 WHERE R.B = T.B; Which of the following tuples is in the result set? 3 5
Consider the following Books database which is used to keep track of books and their readers. Assume that the database is composed of the following three relations where the key attributes are underlined. BOOK Title PERSON READS PID 111 111 222 333 444 BID PID 111 Gender BookID StartDate 2/4/2015 PYear Price Name 2 Internet programming Database System Programmin g using C++ 1 2016 50 Sami M 3 2/6/2015 8/4/2017 Khawla Rawan Zainab Khamis 222 2 2013 45 4 333 444 2 2/6/2015 3 2011 25 555 M 2 2/4/1995 444 1 2/8/1995 Operating Systems Oracle DBMS 4 2009 35 5 2017 50 • Write a SQL query to display the information including title, name (person name), and PID of all the books which have been read (StartDate) in the year 2015, and the price of these books is less than 50. Convert the generated SQL query into a Relational algebra query. Then, draw the optimized query tree (fifth step of query optimization). Note: You can draw a tree on a paper, scan, and upload in the Moodle OR you can describe…
(1) How to prove H using given rules and facts: Rules: Rule 1 A ∧ B → C Rule 2 A → D Rule 3 C ∧ D → E Rule 4 B ∧ E ∧ F → G Rule 5 A ∧ E → H Facts: Fact 1 A Fact 2 B Fact 3 F Hint: The goal is to prove H. First let us use forward chaining. As the conflict resolution strategy, one will fire rules in the order they appear in the database. Let us fire Rule 1, which means to add C to the fact database. Next, Rule 2 is fired, meaning we add D to our fact database. We now have the facts A, B, C, D, F, but we have not yet reached our goal, which is H. Please list the rules to be triggered to add fact H to the database. Now consider using backward chaining. Does backward chaining use fewer rules?
"Witch.Crafts LLC" (WC) has created a database of (not yet retired) witches. After intensive research WC found out that any witch owns at least one cat. They also found that a witch takes care of and develops such a close relationship with her cat(s), that the cat(s) would ultimately decease, if its witch would die (we are pleased to note that witches live forever). Also note that the database only contains cats that are being owned by witches. Please draw two sets of ERDs: the first set represents a strong relationship between witches and cats, while the second set shows a weak relationship between the two. Remember that you need to carefully craft, and identify, the primary/foreign keys. Also pay attention to the kind of line you use for depicting the relationships. You may leave out, however, any non-key attributes. String relationship: weak relationship:
QUESTION 5 Consider the following database schema for a library. Book (BookID:int, BookTitle:string(unique), Author:string, publisher:string) Borrowing-Record (BookID: int, CustomerCPR: int, Date: date, Time: time, Price: double) Customer (CPR:int, name: String) Is it possible to have two different books (with different ID) to have the same title? No, violates referential integrity constraint. Yes. No, violates domain constraints. No, violates entity Integrity constraint. No, violates key constraint. O O
A transaction database contains ten transactions shown below and minimum_support = 30%. Using A-priori, find all frequent itemsets that contain item i. How many frequent itemsets that contain i do we have? TID Items bought { s, u, s, a, n} { s, a, r, a} { s, a, m} 1 2 3 {r, i, c, h, a, r, d} {e,r, i, c} {n, i, c, k} {p, a, t, r, i, c, k} {e, m, i, 1, y} {c,h, a, r, l, e, s} 6. 7 8 9. 10 [lidal
Consider a relational database with the following schema: PERSONS (NAME, DATE-OF-BIRTH, CITY-OF-BIRTH) PLAYS (PERSON-NAME, SPORT) Foreign key: PLAYS (PERSON-NAME) REFRERENCES PERSONS (NAME) For each of the query in the left column below, select the relational algebra from the right column that is the correct answer for it. (5 points each) a. Find the names of the sports that are played by everyone. f. Find the sports that are played by at least one person. g. ✓ Find the name and date of birth of each person who plays the sports tennis. i. Find the name of the person who doesn't play any sports. a. PLAYS/T NAME (PERSONS) b.π NAME, DATE-OF-BIRTH (PLAYS SPORT='tennis' PERSONS) C. IT SPORT (PLAYS NAME=PERSON-NAME PERSONS) d. πT NAME (PERSONS) e. πT NAME (PERSONS)/PLAYS f. I SPORT (PLAYS) g. π NAME, DATE-OF-BIRTH (PLAYS∞ NAME=PERSON-NAME AND SPORT='tennis' PERSONS) h.π PERSON-NAME (PLAYS)-IT NAME (PERSONS) i. π NAME (PERSONS)-TI PERSON-NAME (PLAYS)
Computer Science Describe the differences between MySQLi and PDO, with reference to database connectivity using PHP. Give a detailed example showing how to use Server-Side Prepared Statements, for use with relational databases, using PHP to save multiple records to a database, and outline the advantages of the approach. Using PHP, demonstrate how to extract all records from a Relational Database table and save the records to a MongoDB collection. Please provide a clear description of the structure of the table and collection (name, fields, type, etc.).