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.

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.

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

DataBase Management System Determine the keys and superkeys of the relation R(ABCDEF) with FD's: (You MUST show the step-by-step of how you find superkeys and keys) ACE →D, AEF → B, CE → B, EF → D, and ABDF → E
Computer Science Given the relation R (A, B, C, D, E, F, G) and the set of functional dependencies: F= {BCD → A, BC → E, A → F, F→G, C→D, A→G}, a) Decompose R into 3NF. Show the different steps. b) Is this decomposition also in BCNF? Why or why not?
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?
Suppose we have a relational database with five tables. table key Attributes S(sid, A) Sid T(tid, B) Tid U(uid, C) Uid R(sid, tid, D) sid, tid Q(tid, uid, E) tid, uid Here R implements a many-to-many relationship between the entities implemented with tables S and T, and Q implements a many-to-many relationship between the entities implemented with tables T and U. A. Write an SQL query that returns all records of the form sid, uid where sid is the key of an S- record and uid is the key of a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. B. Write an SQL query that returns records of the form A, C where the A-value is from an S- record and the C-value is from a U-record and these two records are related through the relations R and Q. Use SELECT and not SELECT DISTINCT in your query. C. Could one of your queries from parts (a) and (b) return more records than the other? If so, which one? Justify your answer. D.…
Consider a scenario where two students are vying for registration in a course that has a limited capacity of one spot. What characteristic of a database system prevents both students from obtaining the last remaining seat?
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.
: . 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 situation where there is one open seat in a class with two enrolled pupils. Why can't both students in a database system be assigned to the last seat that is open?
3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the following: (a) identify the candidate keys for R. (b) state whether or not the proposed decomposition of R is lossless join and dependency preserving. Justify your answers. 1. B→C, A→D; decompose into (B,C) and (A,D). 2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D). 3. A→BC, C→AD; decompose into ABC and AD. 4. A→B, B→C, C→D; decompose into AB and ACD. 5. A→B, BC, C→D; decompose into AB, AD and CD.
Suppose you are asked to design a club database system based on the following information. Each student has a unique student id, a name, and an email; each club has a unique club id, a name, a contact telephone number, and has exactly one student as its president. Each student can serve as a president in at most one of the clubs, although he/she can be the members of several clubs. Clubs organize activities and students can participate in any of them. Each activity is described by a unique activity id, a place, a date, a time and those clubs that organize it. If an activity is organized by more than one club, different clubs might contribute different activity fees.QuestionDraw an E-R diagram for the system according to the above description.
Given relation R(u, y, c, d, e, f, w) where there are two keys: {y,c} and {w}. Given a set of functional dependencies F = {fd1: {y,c} -> {u,d,e,f,w}, fd2: u -> c, fd3: w -> {u,y,c,d,e,f}}. Is R in 3NF? Explain why.
Consider the relation schema R=VWXYZ, with the set of functional dependencies F = {VW->XY, V>X, W->Z, YZ->Z, Z→V} A. Give three independent reasons why the following table cannot possibly be a legal instance of R. V W X Y v1 w1 х1 yl z1 v2 w1 x2 y2 z1 v2 w2 x1 y2 z2 B. Show the functional dependencies that hold on each of R1=VWX and R2=WYZ. You do not need to show trivial functional dependencies, or those implied by others in the same set, but you must show all others. C. Is the decomposition of R into R1=VWX and R2=WYZ lossless-join? Why or why not?