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 Two phase locking protocol A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the tra

What are the Constituents of File? Also elaborates all the possible file operations? A file is organised logically as sequence of record. These records are mapped onto disk blo

#Use the following database schema: 1) Patient—PatientID, Name, DOB 2) Doctor—DoctorID, Name, MedLicenseNumber, Phone 3) Medication—MedicationID, BrandName, GenericName 4) Prescrip

While sorting field groups we cannot use more than one key field False.

Explain the uses of deadlock It will lead to deadlock since this is the only place where incoming acknowledgements are processed. Without this code, sender will keep timing ou

Define Assertions in SQL a. An assertion is a predicate that is expressing a condition we wish the database to always satisfy.  b. Domain constraints, functional dependency

What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im

What is object containment? References among objects can be used to model dissimilar real-world concepts.

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

Describe the development process of Object oriented methods Object oriented methods have roots which are strongly anchored back in the 60s, functional and structured methods we