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

Describe the definition of a transaction in sql, Describe the definition of...

Describe the definition of a transaction in SQL  Ans: The SQL transaction starts implicitly. Transactions are finished by either Commit work that commits the transaction and st

Database, How many physical thing?

How many physical thing?

Incident report to the database, The Form input elements are:           ...

The Form input elements are:             Reporter name                                                text type input             Password

Explain about sql server 2000, What is the difference between SQL Server 2...

What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of

Explain query execution plan, Explain query execution plan? - Optimizer...

Explain query execution plan? - Optimizer available in SQL Server optimizes code to be effectively executed. - A query execution plan demonstrates how this optimizer would r

N-ary relationship, For every n-ary relationship type R where n>2, we make ...

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti

The file based system in dbms, The File Based System File based systems...

The File Based System File based systems are an early attempt to computerise the manual filing system. For example, a manual file can be set up to hold all the correspondence r

What are the benefits of prepared statements, What are the benefits of prep...

What are the benefits of prepared statements and place holders? Parameter binding operations automatically handle escaping of characters Encourage Statement reuse

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