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
The natural join is equal to which product? The natural join is equal to Combination of projection and Cartesian product

Evaluate: a.When transactions T1 and T2 are in a deadlock, one of the transactions will eventually implement to completion and let the other one continue implementation. b.

In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Parallelism of transaction execution: A transaction can be divided into various sub-queries that can operate on fragments in parallel. This enhances the degree of concurrency in t



Question 1 What do you mean by database management system? Question 2 Write a note on Object-Oriented Model Question 3 Explain Sequential File Organization Question

Design an EER schema for the following application and translate the EER schema into relational schemas (and constraints). It is possible that some requirements cannot be captured

What is a disjoint less constraint? Ans: It needs that an entity belongs to no much more than one level entity set.  Disjoint less constraint needs that an entity belongs to

For the relations R and S given below: R                      S A B C 1 4 7 2 5 8 3 6 9