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

Identify all renters who have viewed all properties, Consider the subsequen...

Consider the subsequent relations RENTER(rno, fname, lname, address, tel_no, pref_type, max_rent) VIEWING(rno, pno, date, comment) PROPERTY_FOR_RENT( pno, street, area ,city,

Data Minnning, Can i get help with weka software

Can i get help with weka software

Binary relationships, One-to-one relationship: For every 1:1 relationshi...

One-to-one relationship: For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participatio

Vertical fragmentation, Vertical Fragmentation- Vertical fragmentation grou...

Vertical Fragmentation- Vertical fragmentation groups together only those attributes in a relation that are used jointly by various important transactions. A vertical fragment is d

Explain what is to be done during defining problem statement, Briefly expla...

Briefly explain what is to be done during defining problem statement. To define Problem Statement of a system, define what is to be done and how you can go to implement that. Y

#normalisation.., define normalisation and functional dependency

define normalisation and functional dependency

What is the use of unique function, What is the use of unique function? ...

What is the use of unique function? UNIQUE function: If UNIQUE is specified then only unique values are used to computed the mean.

Get details of employee working on both comp354 and comp345, Consider the r...

Consider the relations EMPLOYEE(emp#, name) ASSIGNED_TO(project#, emp#) PROJECT(project#, project_name, chief) Express the subsequent queries in Relational Algebra (i) Ge

The first normal form (1nf), The First Normal Form (1NF) Let us first d...

The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1.      There are no duplicate tuples or rows in the relation. 2.

Explain heap file with advantages, Explain heap file with advantages? H...

Explain heap file with advantages? Heap File is an unordered set or a group of records, stored on a set of pages. This class gives basic support for inserting, updating, select

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