Design a query plan for distributed query, Database Management System

(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.

 

Posted Date: 3/11/2013 1:16:31 AM | Location : United States







Related Discussions:- Design a query plan for distributed query, Assignment Help, Ask Question on Design a query plan for distributed query, Get Answer, Expert's Help, Design a query plan for distributed query Discussions

Write discussion on Design a query plan for distributed query
Your posts are moderated
Related Questions
Explain the terms primary key, candidate key, alternate key and secondary key. In the given table identify every key? STUDENT(SID,Regno, Name, City) Primary Key: The prim

What are the two types of errors? The two types of errors are: a) Logical error b) System error

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Explain Interblock gap? Interblock Gap - A track of a disk is separated into equal-sized disk blocks. Blocks are separated through fixed-size gaps, called as interblock gaps th

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz

What is an Operand? The data on which the operation is to be performed is known as an Operand

What is the purpose of tables, private synonyms and public synonyms? If there are multiple objects of similar name on an Oracle database, that order are they accessed in? The r

explain the steps for reduction of er model into relational model?

Timestamps For Read operations: If TS (T) If TS (T) >= W-timestamp (Q), then the transaction T is trying to read a value of data item Q which has been written and committed

Databases and data warehouses both are databases and both contains number of rows and columns of tables containing data. Data warehouse is really different from databases because d