Distributed query and transaction processing, Database Management System

a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4 would require reconstruction of at least two horizontal and two vertical fragments, as well as a choice of one replica.

b.  Using the centralised schema of 3, show an optimum query plan for your query.

c.  Show two distributed query plans for your query. One assumes all data is transported to another site. The other plan achieves close to minimum data transport and use of at least one semijoin. Using the quantitative analysis of 2 and assumptions based on 3 and 4, estimate the cost of each plan in terms of bytes of data transmitted. Show your working.

d.  Sketch a process to update the product catalogue. The process will have a coordinating transaction and subtransactions responsible for the product table, outlet table and the shopping cart. At least part of the product table will be replicated, so there will be a separate process for each replica. Use a synchronised replication protocol. The process will detail the messages sent from process to process and the read-item and write-item for each database access. Other aspects of the process can be briefly described in English.

Annotate the process with resource lock/unlock commands corresponding to a two-phase locking protocol. Justify your claim that the protocol is two-phase locking in your specific case.

Posted Date: 3/9/2013 12:10:26 AM | Location : United States







Related Discussions:- Distributed query and transaction processing, Assignment Help, Ask Question on Distributed query and transaction processing, Get Answer, Expert's Help, Distributed query and transaction processing Discussions

Write discussion on Distributed query and transaction processing
Your posts are moderated
Related Questions
To delete a particular column in a relation which command is used ? To delete a particular column in a relation ALTER command is used.

differences between a classified catalog and a dictionary catalog

Consider the subsequent relation   Professor (Pfcode, dept, head, time)   It is assumed that      (i) A professor can work in much more than one

1. Staff(staffID, firstName, lastName, availabilityID, experience, phone, mobile, email); 2. Availability(availabilityID, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday,

Define the term Domain. For each n every attribute there is a set of permitted values known as the domain of that attribute.

Question: In relation to distributed database answer the following questions: (i) Give a brief definition of distributed database. Support your answer with an appropriate di

Give a sample of the Dynamic Model. The sample of dynamic model is given below:  Dynamic model for the car: Brake and Accelerator            Brake or Applies Accelerator

What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu

Describe Dynamic Model. The dynamic model specifies allowable sequences of changes to the objects from an object model. It contains event trace diagrams describing scenarios. A

Describe sequential file organization.  Explain the rules for (i)  Inserting a new record. (ii)  Deleting an existing record.          Ans:A sequential f