Suppose that a large store has a transactional database that is distributed among four locations. Transactions in each component database have the same format, namely Tj {1,..., im}, where Tj is a transaction identifier, and ik (1 ≤ k ≤ m) is the identifier of an item purchased in the transaction. Propose an efficient algorithm to mine global association rules. You may present your algorithm in the form of an outline. Your algorithm should not require shipping all of the data to one site and should not cause excessive network communication overhead.

Suppose that a large store has a transactional database that is distributed among four locations. Transactions in each component database have the same format, namely Tj {1,..., im}, where Tj is a transaction identifier, and ik (1 ≤ k ≤ m) is the identifier of an item purchased in the transaction. Propose an efficient algorithm to mine global association rules. You may present your algorithm in the form of an outline. Your algorithm should not require shipping all of the data to one site and should not cause excessive network communication overhead.

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 a database system that includes an atomic increment operation, in addition to the read and write operations. Let V be the value of data item X.The operation increment(X) by C sets the value of X to V + C in an atomic step. The value of X is not available to the transaction unless the latter executes a read(X).Assume that increment operations lock the item in increment mode using the compatibility matrix in Figure 18.25.a. Show that, if all transactions lock the data that they access in the corresponding mode, then two-phase locking ensures serializability.b. Show that the inclusion of increment mode locks allows for increasedconcurrency.
Consider a federated database system in which every local site ensures local serializability, and all global transactions are read only. a. Show by example that nonserializable executions may result in such a system. b. Show how you could use a ticket scheme to ensure global serializability.
Consider the following two transactions: (SHOW WORK) T13: read(A); read(B); if A = 1 then B := B - 1; write(B). T14: read(B); read(A); if B = 1 then A := A - 1; write(A). Let the consistency requirement be A = 1 or B = 1, with A = 1 and B = 1 as the initial values.a. Show that every serial execution involving these two transactions preserves the consistency of the database.b. Show a concurrent execution of T13 and T14 that produces a nonserializable schedule.c. Is there a concurrent execution of T13 and T14 that produces a serializable schedule?
Consider the following two transactions:T13: read(A);read(B);if A = 0 then B := B + 1;write(B).T14: read(B);read(A);if B = 0 then A := A + 1;write(A). Let the consistency requirement be A = 0 ∨ B = 0, with A = B = 0 as the initial values. a. Show that every serial execution involving these two transactions preserves the consistency of the database. b. Show a concurrent execution of T13 and T14 that produces a nonserializable schedule. c. Is there a concurrent execution of T13 and T14 that produces a serializable schedule?
A database has four transactions. Let min_support=60% and min conf=80% TID date Items_bought T100 10/15/99 {K,A,D,B} T200 10/15/2000 {D,A,C,E,B} T300 10/19/2000 {C,A,B,E} T400 10/22/99 {B,A,D} Find all frequent itemset using Apriori and FP-growth respectively, Compare the efficiency of two mining processes List all strong association rules (with support s and confidence c).
Q1. Consider a relation s(A,B) with the following characteristics: • s has 700,000 tuples with 70 tuples per disk block • s has an index on attribute A with index height x=2 • The values that the attribute A takes in relation s are integers which are uniformly distributed in the range 1 ... 200. [Uniformly distributed ➔ there are roughly 3500 tuples for each A value.] (1.a) Assuming that the index on A is a secondary index, estimate the number of disk block accesses needed to compute the query σA=18(s). (1.b) What would be the estimated cost if the index were a clustering index?
Imagine having access to a database containing the x, y coordinates and names of numerous restaurants. Let's assume that only the following types of inquiries are being made: The focus of the investigation is whether or not a restaurant can be located at a particular location. Which indexing technique is superior: It is either a B-tree or an R-tree. Why?
(b) Consider the following scheme to reduce message traffic in distributed deadlock detection. Transactions are assigned unique priorities, and an antagonistic conflict occurs when a transaction waits for a data object that is locked by a lower priority transaction. Deadlock detection is initiated only when an antagonistic conflict occurs. When a waiting transaction; (i) Determine the number of messages exchanged to detect a deadlock in the ‘best’ case.(ii) Determine the number of messages exchanged to detect a deadlock in the ‘average’ case.(iii) Determine the number of messages exchanged to detect a deadlock in the ‘worst-case’(iv) Determine the saving (in percentage) in the average number of messages exchanged under this message traffic reduction scheme as compared to when no such is used(c) Why does the interrupt disable method to achieve mutual exclusion not work for multiprocessor systems?(d) Consider a magnetic disk consisting of 16 heads and 400 cylinders. This disk has four…
Question No 1: Re-arrange operations of the transaction given in schedule in such a way that deadlock must not occur in the given schedule. You are only allowed to change sequence of operations in a transaction. You are not allowed to delete or insert new operations. Rewrite the new schedule again and construct its “Wait-for Graph”. New graph must not have any deadlock in it.
Consider that a database contains the following relations PARENT(X, Y), and a relation BIRTH(X, B), where B is the birthdate of a person X. The following information is used for question (b), (c) that we have the following family tree
1.) Part A (10): Develop a solution for the Dining Philosopher’s problem using AND-Synchronization (i.e., Parallel Semaphores SP and SV). Write the pseudocode for the philosopher processes. 2.) Part B (15): Consider the Readers-Writers Problem with Reader Priority. Suppose that the database is designed such that it can accommodate at most seven (7) concurrent readers active in the database. Develop a Monitor solution that solves the Readers-Writers Problem with the additional constraint of a maximum of 7 concurrent readers. You will have to write the monitor functions “start_read()”, “end_read()”, “start_write()”, and “end_write().” You must provide the pseudo-code for the Monitor procedures listed above, any condition or status variables used. Also include the pseudo-code of any additional helper procedures if your solution requires them. You must also write the pseudo-code for the Reader and Writer processes that use your monitor solution.
Assume that two concurrent executing transactions T₁ and T₂ are allowed to update same stock item say 'A' in an uncontrolled manner. In such scenario. Give the problems no concurrency module and allows concurrent execution.