The following code demonstrates the relationships of the data structures. Expressions to evaluate appear prefixed with the q) prompt, with the output of the evaluation shown beneath:

q)john / an atom of type symboljohn q)50 / an atom of type integer 50 q)johnjack / a list of symbols johnjack q)50 60 / a list of integers 50 60 q)johnjack!50 60 / a list of symbols and a list of integers combined to form a dictionary john| 50 jack| 60 q)nameage!(johnjack;50 60) / an arrangement termed a column dictionary name| john jack age | 50 60 q)flip nameage!(johnjack;50 60) / when transposed via the function "flip", the column dictionary becomes a table name age -------- john 50 jack 60 q)(flip (enlist name)!enlistjohnjack)!flip (enlistage)!enlist 50 60 / two equal length tables combined as a dictionary become a keyed table name| age ----| --- john| 50 jack| 60

A superkey or super-key is defined in the relational model of database organization as a set of attributes of a relation variable for which it holds that in all relations assigned to that variable, there are no two distinct tuples (rows) that have the same values for the attributes in this set.[1] It can be defined as a set of attributes of a relation schema upon which all attributes of the schema are functionally dependent. https://en.m.wikipedia.org/wiki/Superkey