Sort-merge join
id:
sort-merge-join-251-6731009
title:
Sort-merge join
text:
The sort-merge join is a join algorithm and is used in the implementation of a relational database management system. The basic problem of a join algorithm is to find, for each distinct value of the join attribute, the set of tuples in each relation which display that value. The key idea of the sort-merge algorithm is to first sort the relations by the join attribute, so that interleaved linear scans will encounter these sets at the same time. In practice, the most expensive part of performing a
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm used in relational databases
original url:
https://en.wikipedia.org/wiki/Sort-merge_join
date created:
date modified:
2024-04-05T06:55:09Z
main entity:
{"identifier":"Q4060688","url":"https://www.wikidata.org/entity/Q4060688"}
image:
fields total:
13
integrity:
14