Jump to content

Hash join: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

17 January 2024

31 December 2022

3 December 2022

2 December 2022

3 November 2022

3 June 2022

17 February 2021

26 July 2020

4 May 2020

18 September 2019

10 February 2019

25 November 2018

18 November 2018

13 September 2018

  • curprev 03:3203:32, 13 September 20182601:381:4200:16d:4981:1348:b29d:58e8 talk 7,405 bytes +8 Previously, there was a paragraph that said "hash joins are similar to nested loops" which is too generic to have any meaning, and honestly doesn't make any sense (too many differences exist between hash joins and nested loops to call them similar without specifying specific similarities). The paragraph also said that hash joins are faster than nested loops, but this is certainly not true for several situations. I corrected this statement so that it says "Hash joins are typically more efficie... undo Tags: Mobile edit Mobile web edit

29 August 2018

11 August 2017

27 January 2017

30 September 2016

25 August 2016

18 June 2015

14 February 2015

5 February 2015

19 September 2014

6 August 2014

17 July 2014

30 June 2014

20 January 2014

26 August 2013

14 March 2013

26 January 2013

10 July 2012

21 May 2012

3 May 2012

7 November 2011

11 August 2011

  • curprev 21:0821:08, 11 August 2011Randallbsmith talk contribs 7,353 bytes +273 I've expanded the text in the "Classis hash join" section, as the actual contents of the hash table were not deescribed. I aso thought it wise to mention the the benefit of using a hash table. undo

1 April 2011

20 December 2010

7 December 2010

6 December 2010

3 November 2010

28 October 2010

5 October 2010

7 August 2010

8 June 2010

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)