Design a query plan for distributed query, Database Management System

Assignment Help:

(a) Design a query plan for the following distributed query: An application at site B wants to compute a join of STUDENT ?Id=StudId TRANSCRIPT where STUDENT (Id,Major) is at site B and TRANSCRIPT (StudId, CrsCode) is at site C. The result should be returned to B. Assume that semijoin is not used. Also assume that

  • Value lengths are:
  1. Id and StudId are 8 bytes long;
  2. Major is 3 bytes long;
  3. CrsCode is 6 bytes long.
  • STUDENT has 15,000 tuples.
  • 6,000 students are registered for at least one course. On the average, each student is registered for 5 courses.

(b)   Estimate the cost of computing σMajor='CS' (STUDENT) ?Id = StudId TRANSCRIPT using the semijoin strategy. Use the sizes of the STUDENT and TRANSCRIPT relations and of their attributes from the part (a) above. In addition, assume that 10% of the students major in CS. Compare this with the solutions in part (a) above that do not use the semijoin.

 


Related Discussions:- Design a query plan for distributed query

Define the term- making common behaviour abstract, Making Common Behaviour ...

Making Common Behaviour Abstract Let us define abstraction "Abstraction means to focus on the necessary, inherent aspects of an entity and ignoring its accidental features". O

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

Transactions and concurrency management, Transactions And Concurrency Manag...

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 relational dbms, What is Relational DBMS This is our subject of...

What is Relational DBMS This is our subject of study. A DBMS is relational if the data is organized into relations, that is, tables. In RDBMS, all data are kept in the well-kno

Describe the storage structure of indexed sequential files, Describe the st...

Describe the storage structure of indexed sequential files and their access method.  Ans:   Storage structure of Indexed Sequential files and their access: To achieve fast rand

What is recovery management component, What is recovery management componen...

What is recovery management component? Ensuring durability is the responsibility of a software component of the base system known as the recovery management component.

Explain the concepts of relational data model, Explain the concepts of rela...

Explain the concepts of relational data model? Relational Data Model - The relational model was first introduced through Prof. E.F. Codd of the IBM Research in the year 1970

Define average seek time, Define average seek time. The average seek ti...

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

What is the object-oriented decompositions, Object-oriented decompositions ...

Object-oriented decompositions Object-oriented decompositions of systems better are able to cope with change. Each subsystem has a well-defined interface which communicates with

Define the normalisation form, Define in which normalisation form if an att...

Define in which normalisation form if an attribute of a composite key is dependent on an attribute of other composite key. Ans: 3NF A relation is in 3 NF if an attribute of

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