"[The] actual data processing in the operators is performed by a set of execution primitives - simple, specialized and CPU-efficient functions. [..] The simplicity of these primitives allows compilers to produce code that achieve [instructions per cycle] of over 2 and [..] spend only a few cycles per tuple. In the case of a multiplication of two values, X100 spends 2 cycles per tuple, whereas MySQL spends 49."

"[..] primitives in X100 are generated from a so-called signature request and a code pattern. This allows X100 to generate compound primitives that execute an entire expression subtree (e.g. (a*1.19+b)*0.95). Currently, primitive generation is predefined, but the ultimate goal is to allow a query optimizer to generate and compile compound primitives in a just-in-time fashion."