Sort merge join ( Joins)

From Algorithm Wiki
Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn + mlogm)$ == Space Complexity == $O(n+m)$? words (Need sorted lists of indices of input tables) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM(?) == Year == 1960 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nlogn + mlogm)$

Space Complexity

$O(n+m)$? words

(Need sorted lists of indices of input tables)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM(?)

Year

1960

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Sort_merge_join_(_Joins)&oldid=45251"