Does the Q/K implementation actually execute in parallel? I've always had a hard time figuring out exactly why K is supposed to be so fast (except for column stores, interpreter fitting in L1 cache, and fast hand-written primitives).
[1] http://code.kx.com/wiki/Reference/peach
[2] http://code.kx.com/wiki/Reference/peach#Peach_using_multiple...