Given the following transaction database: Transaction IDe itemse I1, 12, 13ª 12, 13, 14ª 14, I5- I1, 12, 14ª I1, 12, 13, I5- 11, 12, 13, 14е T1e T2e T3e T4e T5e T6e What is the output of the Apriori algorithm run on the above transaction database with a minimum support of 60 % ?- Calculate the following confidence: {I1, 12} => { I3}- {12} => {I1, 13}« {I1, 13} => {I2}« Calculate the following lift: {I2} => {I3}« {I2} => {I4} {11, 13} => {12}-

Given the following transaction database: Transaction IDe itemse I1, 12, 13ª 12, 13, 14ª 14, I5- I1, 12, 14ª I1, 12, 13, I5- 11, 12, 13, 14е T1e T2e T3e T4e T5e T6e What is the output of the Apriori algorithm run on the above transaction database with a minimum support of 60 % ?- Calculate the following confidence: {I1, 12} => { I3}- {12} => {I1, 13}« {I1, 13} => {I2}« Calculate the following lift: {I2} => {I3}« {I2} => {I4} {11, 13} => {12}-

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

Consider the following two transactions:T34: read(A);read(B);if A = 0 then B := B + 1;write(B).T35: read(B);read(A);if B = 0 then A := A + 1;write(A).Add lock and unlock instructions to transactions T31 and T32 so that they observe the two-phase locking protocol. Can the execution of these transactionsresult in a deadlock?
Consider the schedule S1 consists of three transactions T1, T2, T3 as the following: Answer the following question: Is the schedule S1 cascadeless and recoverable? Justify your answer. Draw the precedence graph of schedule S1 Is S1 conflict-serializable? Explain briefly. If S1 is conflict-serializable, write down all equivalent serial schedules.
Consider the schedule S1 = w1(A), r2(A), w1(B), w3(C), r2(C), r4(B), w2(D), w4(E), r5(D), w5(E) on five transactions T1, T2, . . . , T5. How many serial and how many non-serial schedules the above transactions T1, T2, . . . , T5 can have?
Given the following transaction database: Sales ID Items S1 {O, W, C, N, Z} S2 {O, C, K, N, Z} S3 {K, N, W, Z, O} S4 {K, W, Z, O} S5 {C, K, N, Z} S6 {O, K, N} S7 {O, N, W, Z} S8 {K, N, Z} What is the output of the Apriori algorithm run on the Previous transaction database with Support 40% and Confidence 90%? Using Apriori Algorithm for Findi the frequent item sets and association rules.Working steps must be shown.
Given the following transaction database: Sales ID Items S1 {O, W, C, N, Z} S2 {O, C, K, N, Z} S3 {K, N, W, Z, O} S4 {K, W, Z, O} S5 {C, K, N, Z} S6 {O, K, N} S7 {O, N, W, Z} S8 {K, N, Z} What is the output of the Apriori algorithm run on the Previous transaction database with Support: 0.4Confidence: 0.9? Working steps must be shown.
Consider the following two transactions: T1: R(x),R(Y),Y=Y+2,W(Y) T2:R(Y),R(X),X=X+10,W(X) Rewrite transction T1 and T2 by applying the tow phase locking algorithm? Is the T1 and T2 offers deadlock? Suport your answer by example.
Consider a multi-granularity locking system, with lock modes S, X, IS, IX, and SIX as in lecture and database-level, file-level, page-level and record-level locking as shown in the following figure. Provide the sequence of lock requests required to perform the following transactions and write necessary complete Lock and Unlock operations in their correct order. T3 want to read all pages in F1 and modify about 10 pages, which can be identified only after reading F1.(MY ANSWER) Lock-SIX(DB); Lock-S(F1); Lock-X(P1); Lock-X(P1000); Unlock(P1000); Unlock(P1); Unlock(F1); Unlock(DB); is it corect? ………………………………………………………………………………………
We have the following two transactions:T1: R(A), R(B), if A = 0 then B:=B+1, W(B)T2: R(B), R(A), if B = 0 then A:=A+1, W(A)Basis consistency is guaranteed by A = 0 ∨ B = 0 with initial values A = B = 0.a) Show that after both possible successive executions the database maintains consistency.b) Give an example where concurrent execution would lead to database inconsistencyc) Is there an example of concurrency that would preserve consistency?
Consider the following schedule of transactionsW1(A) W2(A) W1(A) W2(A) W1(A)Which of the following properties are true for the above schedule and justify the reason for your answer with explanation?a) Conflict Serializableb) View Serializablec) Recoverable I asked this question before but i think that was incorrect. Please answer these question in detail with full explaination. I need a proper long answer. Thanks .
In timestamp ordering, W-timestamp(Q) denotes the largest timestamp of any transaction that executed write(Q) successfully. Suppose that, instead, we defined it to be the timestamp of the most recent transaction to execute write(Q) successfully. Would this change in wording make any difference? Explain your answer.
2. Two-phase commit assures that all sites agree as to whether a given transaction T commits or aborts.Suppose there are 3 sites. Transaction coordination C1 sends out the message Prepare T, which isreceived by both C2 and C3. Then C2 and C3 respond with Ready T to C1. Due to some reason, onlyC2 has the Commit T log record in its stable storage. List all 2PC-related log records on the 3 sitesregarding transaction T.3. Continuing the example of question 2, what’s a possible reason that only one ready T has reached C1?
Consider a failure that occurs during 2PC for a transaction. For each possible failure that you listed in Exercise 23.2a, explain how 2PC ensures transaction atomicity despite the failure.