Distributed query and transaction processing, Database Management System

Assignment Help:

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.


Related Discussions:- Distributed query and transaction processing

Maping constraits, #question.what is mapping constraints and types?.

#question.what is mapping constraints and types?.

Determine Which is not a consequence of concurrent operation, Determine Whi...

Determine Which is not a consequence of concurrent operations? Ans: Update anomaly.

Normalization, a project based on normalization with first, second and thir...

a project based on normalization with first, second and third normalization. There need to be a diagram also

Key constraint - relational constraints, This constraint shows that the key...

This constraint shows that the key attribute value in each tuple must be unique, i.e., no two tuples have the similar value for the key attribute. This is because the value of the

Relation and relational schema, A relation has: Relational Schema ...

A relation has: Relational Schema Relation instance Relational Schema: A relational schema shows the relation's name, its attributes and the domain of every a

What are the causes of bucket overflow in a hash file, What are the causes ...

What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflow? When a record is inserted, the bucket to that

List the table modification commands in sql, List the table modification co...

List the table modification commands in SQL? A) Deletion B) Updates C) Insertion D) Update of a view

Decomposition, properties of derirable decomposition

properties of derirable decomposition

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd