SóProvas


ID
1827835
Banca
FGV
Órgão
INEA-RJ
Ano
2013
Provas
Disciplina
Banco de Dados
Assuntos

Assinale a alternativa que indica os principais algoritmos de junção implementados pelos sistemas gerenciadores de banco de dados.

Alternativas
Comentários
  • FGV está tentando superar a FCC em questões ruins de TI.

  • Poderia colocar pelo menos os termos em inglês.



    Hash joins - In a hash join, the Oracle database does a full-scan of the driving table, builds a RAM hash table, and then probes for matching rows in the other table. For certain types of SQL, the hash join will execute faster than a nested loop join, but the hash join uses more RAM resources.  A method for joining large data sets. The database uses the smaller of two data sets to build a hash table on the join key in memory. It then scans the larger data set, probing the hash table to find the joined rows.


    Nested loops join - The nested loops table join is one of the original table join plans and it remains the most common.  In a nested loops join, we have two tables a driving table and a secondary table.  The rows are usually accessed from a driving table index range scan, and the driving table result set is then nested within a probe of the second table, normally using an index range scanmethod.


    Sort merge join - A type of join method. The join consists of a sort join, in which both inputs are sorted on the join key, followed by a merge join, in which the sorted lists are merged.



    Outros métodos podem ser encontrados neste glossário da documentação oficial.


    Fonte: https://docs.oracle.com/database/121/TGSQL/glossary.htm#GUID-2A7F42FE-2859-4B9C-83AD-EFF8FFB4AB92


    Outra fonte: http://www.dba-oracle.com/t_hash_join_vs_nested_loops_join.htm