Describe the nested-loop join and block-nested loop join, Database Management System

Assignment Help:

Describe the nested-loop join and block-nested loop join. 

 Ans:   The block nested- loop join algorithm is as described below:   

 for every block Br of relation R do begin       

   for every block Bs of  relation S do begin    

    for every tuple tr in Br do begin    

     for every tuple ts in Bs do begin   

      test pair (tr,ts) to see if they satisfy the join  

     condition                                      

        if they do, add tr.ts to the result  

     end

    end

   end

 end          

  The nested-loop from algorithm is like this: 

  for every tuple tr in relation R do begin

                for every tuple ts in relation S do begin

   test pair (tr,ts) to see if they satisfy the join condition   

    if they do, add tr.ts to the result

                     end

      end


Related Discussions:- Describe the nested-loop join and block-nested loop join

Write query to select student from math department, Consider the table stud...

Consider the table student and list names of students in the departments other than maths and computer. SELECT std_name FRM student WHERE dept_name NOT IN (‘Maths','Computer);

Database Normalization, I have a homework assignment due today by midnight....

I have a homework assignment due today by midnight. I need help understanding databasse normalization and determining the type of form violation & how to fix the violation.

A distributed transaction, A Distributed Transaction Let us demonstrate...

A Distributed Transaction Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Ev

What are stand-alone procedures, What are stand-alone procedures? Proce...

What are stand-alone procedures? Procedures that are not part of a package are called as stand-alone because they independently defined. A good example of a stand-alone procedu

Explain what is to be done during defining problem statement, Briefly expla...

Briefly explain what is to be done during defining problem statement. To define Problem Statement of a system, define what is to be done and how you can go to implement that. Y

Discuss the mechanism to read data from and write to a disk, Discuss the me...

Discuss the mechanism to read data from and write to a disk? Disk read/write heads are mechanisms in which read data from or write data to disk drives. The heads have gone by

What are the different types of interfaces provided by dbms, Question 1 Su...

Question 1 Suppose the employee employee id, name, designation, salary, attendance and address of any employee has to be stored in a database. You can store these data in a sequen

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

ERD, A student entity type has the following attributes,name..

A student entity type has the following attributes,name..

When are two schedules said to be view equivalent, When are two schedules s...

When are two schedules said to be view equivalent?     Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met

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