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

Create a subroutine, 1. Create a subroutine that does the remote blast on t...

1. Create a subroutine that does the remote blast on the file protein.fa. 2. Pass that returned files from the blast to another subroutine that parses the output and sends it to

Triggers and Stored Procedures, 10A.53 Code an Oracle Database trigger to e...

10A.53 Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department. 10A.54 Code an Oracle Database trigger to allow the delet

Explain the relational completeness, Explain the Relational Completeness ...

Explain the Relational Completeness Codd described the term relational completeness to consider to a language that is complete with respect to first-order predicate calculus ex

What is recursive closure and operation relational algebra, What is recursi...

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

Define canonical cover, Define canonical cover? A canonical cover Fc fo...

Define canonical cover? A canonical cover Fc for F is a set of dependencies like F logically implies all dependencies in FC and Fc logically shows all dependencies in F.

Normalization, in case of functional dependencies how we get the higher nor...

in case of functional dependencies how we get the higher normal form.

Method of analyzing association traversal, Analyzing Association Traversal ...

Analyzing Association Traversal Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application,

Which data type can store unstructured data, Which data type can store unst...

Which data type can store unstructured data? Raw data type can store unstructured data.

Explain tuple variable, Define tuple variable? Tuple variables are used...

Define tuple variable? Tuple variables are used for comparing two tuples in the same relation. The tuple variables are explained in the from clause by way of the as clause.

Relationship, what is the relationship between receipt and owner entities i...

what is the relationship between receipt and owner entities in computer sales and service company

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