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

Physical database design issues, Physical Database Design Issues The da...

Physical Database Design Issues The database design includes the process of logical design with the use of E-R diagram, normalisation, etc., followed by the physical design.

Consistency-transaction , Consistency: This property makes sure that a com...

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Entities, Entities Let us first be aware of the question: What are e...

Entities Let us first be aware of the question: What are entities? An entity is an object of concern used to show the things in the actual world, e.g., table, car, bo

Define deferred update technique of recovery, Discuss deferred update techn...

Discuss deferred update technique of recovery.  What are the advantages?  Ans:  The deferred update methods do not physically update the database on disk till after a transact

Data Analysis, A buyer for a large department store chain must place orders...

A buyer for a large department store chain must place orders with an athletic shoe manufacturer six months prior to the time the shoes will be sold in the department stores. In par

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

Can your organization scan large format documents, Can your organization sc...

Can your organization scan large format documents? Yes, large format scanning used for such entities as city plans and blueprints is available. We selected scanners with the ab

State the design of associations, State the Design of Associations Bef...

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

Problems of concurrent transactions-lost updates, Lost Updates : Suppose th...

Lost Updates : Suppose the two transactions T3 and T4 run simultaneously and they happen to be interleaved in the following way (suppose the initial value of X as 10000):

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