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

ER-diagram, The State of NewYork certifies firefighters throughout state an...

The State of NewYork certifies firefighters throughout state and keep track all of them, as well as of the state’s fire departments. Each fire department has unique department numb

Describe the concept of aggregation, Aggregation Aggregation is strong...

Aggregation Aggregation is stronger form of association. It represents the "has-a" or "part-of" relationship. An aggregation association depicts a complex object which is comp

Define the third normal form, Define the Third Normal Form: The third ...

Define the Third Normal Form: The third normal form (3NF) is a normal form employed in database normalization. 3NF was initially defined by E.F. Codd in 1971. Codd's definitio

Describe file organisation, Describe file organisation? A file is organ...

Describe file organisation? A file is organized logically as a sequence of records. These records are mapped onto disk blocks. A) Fixed-Length Records Type deposit=record

Deadlock prevention, Deadlock Prevention One of the easiest approaches ...

Deadlock Prevention One of the easiest approaches for avoiding a deadlock would be to obtain all the locks at the begin of the transaction. Though, this approach restricts conc

Hello, Java program for horrizontal fragmentation in distributed database

Java program for horrizontal fragmentation in distributed database

Describe the different raid levels, Describe the different RAID levels.  Di...

Describe the different RAID levels.  Discuss the choices of the different RAID levels for different applications.          Ans:   There are several combinations of these approa

The average amount of their orders , Make SQL statements for the following ...

Make SQL statements for the following scenarios. Your response should contain SQL statement, output and any other assumptions you have made to arrive at the answer. For Colorado cu

Data base design, how to design a bakery business in data base

how to design a bakery business in data base

What is the difference between where and having clauses, What is the differ...

What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.

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