Problem Statement

An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm. Implement the "hash join" algorithm, and demonstrate that it passes the test-case listed below. You should represent the tables as data structures that feel natural in your programming language. The "hash join" algorithm consists of two steps:

In pseudo-code, the algorithm could be expressed as follows: The order of the rows in the output table is not significant. If you're using numerically indexed arrays to represent table rows (rather than referring to columns by name), you could represent the output rows in the form [[27, "Jonah"], ["Jonah", "Whales"]].

Let's start with the solution:

(de A
   (27 . Jonah)
   (18 . Alan)
   (28 . Glory)
   (18 . Popeye)
   (28 . Alan) )

(de B
   (Jonah . Whales)
   (Jonah . Spiders)
   (Alan . Ghosts)
   (Alan . Zombies)
   (Glory . Buffy) )

(for X B
   (let K (cons (char (hash (car X))) (car X))
      (if (idx 'M K T)
         (push (caar @) (cdr X))
         (set (car K) (list (cdr X))) ) ) )

(for X A
   (let? Y (car (idx 'M (cons (char (hash (cdr X))) (cdr X))))
      (for Z (caar Y)
         (println (car X) (cdr X) (cdr Y) Z) ) ) )