Distributed query and transaction processing, Database Management System

Distributed query and transaction processing

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 twophase locking protocol. Justify your claim that the protocol is two-phase locking in your specific case.

Posted Date: 3/8/2013 5:57:04 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
Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

What are the advantages of having an index structure?      Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco

Describe briefly models which define the operations on classes. The three models which are used to define operations on classes are as: Object Model = data dictionary + Obje

Transactions And Concurrency Management  Introduction One of the main benefits of storing data in an integrated repository or a database is to permit sharing of it betwee

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

Explain the ANSI SPARC architecture The three-schema architecture is as well known as ANSI SPARC architecture. The aim of the three-schema architecture is to separate the user

a) Distinguish between ‘database' and ‘Database Management Systems (DBMS)'. b) List and briefly describe five potential benefits of the database approach compared to conventio

Explain the relevance of Data Dictionary in a Database System? Data dictionary is a database in its own right residing on the disk that consist of Meta data which is = Data abo

Question: Consider the following database relations for a textbook ordering system used by a college bookshop: Book (b-copy#, bname, ISBN#, author, price, subject) Order (s#

Adding Redundant Associations for Efficient Access The expression redundant association means using "duplicate association for proficient access". While analysis, it is not a