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
What is system catalog or catalog relation? How is better known as? A RDBMS maintains a explanation of all the data that it contains, information about every relation and index

Problem 1. Write the SQL queries using Data Manipulation Language (DML) statements. Insert values into student table with field names using insert command Display the

Suppose that in an organisation, an employee may do different roles in dissimilar projects. Say, RAM is doing coding in one project and doing designing in another. Suppose that the

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

What are audit trails? An audit trail is a log of all alters to the database along with information like which user performed the change and when the alter was performed.

Explain recovery process after system failure using checkpoint. Ans: Checkpoint scheme or method is an extra component of the log based recovery system. This scheme is used to

Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

What are stored-procedures? And what are the advantages of using them? Stored procedures are database objects that perform a user defined operation. A stored procedure can have

The Conceptual Level or Global level The conceptual level presents a logical view of the complete database as a unified whole. It permits the user to bring all the data in th