Generating a Venn diagram using a columnar database management system

A system, comprising:

• a processor;
• a memory;
• a non-transitory computer-readable medium;
• and
• instructions stored on the non-transitory computer-readable medium and translatable by the processor for:
• receiving, from a client device over a network, a request for generation of a Venn diagram, the request indicating input data sets, each input data set having a plurality of data elements;
• loading the input data sets into the memory;
• generating, based on the input data sets indicated by the request, a truth table having multiple entries for combinations of the input data sets, each entry for a combination of the input data sets, each combination corresponding to an intersection of the input data sets, each entry associated with a binary value having bits, wherein positions of the bits in the binary value correspond to the input data sets, wherein the bits consist of zeros and ones, wherein a value of a bit determines whether an input data set, which corresponds to a position of the bit, is included in a combination of the input data sets represented by the binary value, wherein the positions of the bits in the binary value comprise a first position, a second position, and a third position, and wherein the input data sets comprise a first input data set, a second input data set, and a third input data set;
• sorting the multiple entries of the truth table, the sorting comprising ranking combinations of the input data sets based on a number of ones in each binary value associated with the multiple entries of the truth table;
• and
• determining, from the truth table thus sorted, a next intersection set to process for the Venn diagram after a particular intersection set is processed to thereby determine intersection sets for the Venn diagram in an order that efficiently utilizes data that has been previously loaded in the memory.

A computer program product comprising a non-transitory computer-readable medium storing instructions translatable by a processor of a computer system having a memory for:

• receiving, from a client device over a network, a request for generation of a Venn diagram, the request indicating input data sets, each input data set having a plurality of data elements;
• loading the input data sets into the memory;
• generating, based on the input data sets indicated by the request, a truth table having multiple entries for combinations of the input data sets, each entry for a combination of the input data sets, each combination corresponding to an intersection of the input data sets, each entry associated with a binary value having bits, wherein positions of the bits in the binary value correspond to the input data sets, wherein the bits consist of zeros and ones, wherein a value of a bit determines whether an input data set, which corresponds to a position of the bit, is included in a combination of the input data sets represented by the binary value, wherein the positions of the bits in the binary value comprise a first position, a second position, and a third position, and wherein the input data sets comprise a first input data set, a second input data set, and a third input data set;
• sorting the multiple entries of the truth table, the sorting comprising ranking combinations of the input data sets based on a number of ones in each binary value associated with the multiple entries of the truth table;
• and
• determining, from the truth table thus sorted, a next intersection set to process for the Venn diagram after a particular intersection set is processed to thereby determine intersection sets for the Venn diagram in an order that efficiently utilizes data that has been previously loaded in the memory.