The naive algorithm that joins two relations <math>R</math> and <math>S</math> by making two nested loops: For each tuple in R as r do For each tuple in S as s do If r and s satisfy the join condition Then output the tuple <r,s> This algorithm will involve nr*bs+ br block transfers and nr+br seeks. Where br and bs are number of blocks in relations r and s respectively.

PropertyValue
dbpprop:abstract
  • The naive algorithm that joins two relations <math>R</math> and <math>S</math> by making two nested loops: For each tuple in R as r do For each tuple in S as s do If r and s satisfy the join condition Then output the tuple <r,s> This algorithm will involve nr*bs+ br block transfers and nr+br seeks. Where br and bs are number of blocks in relations r and s respectively. The algorithm runs in <math>O(|R||S|)</math> I/Os, where <math>|R|</math> and <math>|S|</math> is the number of tuples contained in <math>R</math> and <math>S</math> respectively. Can easily be generalized to join any number of relations. The block nested loop join algorithm is a generalization of the simple nested loops algorithm that takes advantage of additional memory to reduce the number of times that the <math>S</math> relation is scanned.
  • Алгоритм соединения вложенными циклами (Nested loops join) —- разновидность алгоритма соединения.
dbpprop:hasPhotoCollection
rdfs:comment
  • The naive algorithm that joins two relations <math>R</math> and <math>S</math> by making two nested loops: For each tuple in R as r do For each tuple in S as s do If r and s satisfy the join condition Then output the tuple <r,s> This algorithm will involve nr*bs+ br block transfers and nr+br seeks. Where br and bs are number of blocks in relations r and s respectively.
  • Алгоритм соединения вложенными циклами (Nested loops join) —- разновидность алгоритма соединения.
rdfs:label
  • Nested loop join
  • Алгоритм соединения вложенными циклами
owl:sameAs
skos:subject
foaf:page