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: {i₁,..., im}, where T; 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: {i₁,..., im}, where T; 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 three transactions: T1, T2, and T3. S: W1(A); R2(A);W3(B); W2(A);W1(A); R2(C); R3(B); R3(A); W3(B); C1;C2;C3 a) Draw the precedence graph for the schedule. Is the schedule conflict- serializable? b) Is the schedule recoverable?
For two SQL queries of the same complexity, one in a parallel database scenario and one in a distributed database scenario, which (if any) should take longer to optimize and why? The query would take longer to optimize on a distributed database. Because different machines have different performance power, network performance is likely to be slower and may vary across the system, and some data sources might only be accessible from certain machines. The query would take longer to optimize on a parallel database because each node is homogenous and connected to a large global storage system, which is inherently slow due to its size, and any complex query will take considerable time to process. It depends on how the query is written. There should not be a difference in the query processing time if the complexity of the queries is equivalent to each other.
Consider a federated database system in which it is guaranteed that at most one global transaction is active at any time, and every local site ensures local serializability.a. Suggest ways in which the federated database system can ensure thatthere is at most one active global transaction at any time.b. Show by example that it is possible for a nonserializable global scheduleto result despite the assumptions.
Consider the following database schema for University Library database. A student can borrow many books and a given book can be borrowed by any student if it is available in the library. For each borrowing, the borrowing and return dates are registered in the database. Student (SID: long, CPR:long (unique), Name:string, tel:number, major:String, gender:Character {'F' or 'M'}) Book (ISBN:long Title:string (unique), Author:string) BorrowedItems(stSID:long, book|SBN:long, serialNo:int (unique), BorrowingDate:date, ReturnDate:date) Write SQL statements to: 1. List ISBN, Title, Author of all books that include the word 'Database' in their titles in a descending order of ISBN. 2. List SID, Name, and Major of all female students doing major in CS'and their name starts with 'S'. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).
: . 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 {₁,..., 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.
Consider a database that belongs to an airline and employs snapshot isolation for its database management system. Describe an instance in which a nonserializable execution takes place, but the airline is open to the possibility that it will be prepared to tolerate it in exchange for improved overall performance.
Consider a database table that includes a salary attribute. Suppose the three queries avg, count, and max (in that order) are made on the salary attribute, all conditioned on the same predicate involving other attributes. That is, a specific subset of records is selected and the three queries are performed on that subset. Suppose that the first two queries are answered and the third query is denied. Is any information leaked?
Examples of what kind of website may be found on Twitter and LinkedIn:
The utilization of "snapshot isolation" can be employed as an illustrative example to elucidate the construction of a database for an airline. In the event that airlines are capable of enhancing their overall performance, could the acceptance of a non-serializable method be deemed appropriate?
Let A={a.b.c.de) and S, T, U and V relations on A where S= {(a.a), (ab), (bea), (bd), (Ge), (ed), (aa)} T= {(ab), (ka), (ks), (kd), lee), (de), (ab)} U= {(a,b), (aa), (bc), (bub), (ee), (ba), (ab), (ac), (d.d), lac), (ea} V= {(ab), (kc), (kb), lee), (ka), (ab), (dd), las), (a)} a) Which of the relations are reflexive? Justify your answer. b) Which of the relations are antisymmetric? Justify your answer. c) Find Un V. d) Find T-S.
2. Let A = {0,1}. Determine all relations on A.
Consider the following transaction database: tid 1₁ 12 13 14 15 16 17 18 itemset ABCD ACDF ACDEG ABDF BCG DFG ABG CDFG a) Using minsup = 3/8, show how the Apriori algorithm enumerates all frequent itemsets. b) Using minconf=0.80, generate all association rules from above frequent 3-itemsets.