US 12,346,313 B2
Methods and systems for generating logical queries
Danny Singer, Robertsbridge (GB)
Assigned to Noetica Ltd., Crawley (GB)
Appl. No. 17/995,804
Filed by Noetica Ltd., Crawley (GB)
PCT Filed Apr. 9, 2021, PCT No. PCT/GB2021/050880
§ 371(c)(1), (2) Date Oct. 7, 2022,
PCT Pub. No. WO2021/205186, PCT Pub. Date Oct. 14, 2021.
Claims priority of application No. 2005319 (GB), filed on Apr. 9, 2020.
Prior Publication US 2023/0153297 A1, May 18, 2023
Int. Cl. G06F 16/242 (2019.01); G06F 16/2455 (2019.01)
CPC G06F 16/2428 (2019.01) [G06F 16/242 (2019.01); G06F 16/24558 (2019.01)] 16 Claims
OG exemplary drawing
 
1. A computer-implemented method for generating and sending a machine processable form of a logical query, comprising:
providing, on a display device of a computing device, two or more shapes that can be manipulated by a user to form a diagram representing the logical query, wherein the two or more shapes correspond to respective data sets;
for each shape of the two or more shapes, automatically determining, by the computing device, one or more highest intersection cardinality regions within the shape;
based on the one or more highest intersection cardinality regions, generating, by the computing device, a machine processable form of the logical query, wherein the generating comprises translating a set theory expression into the logical query;
constructing, by the computing device, the set theory expression V which initially is equal to an empty set; and
sending, by the computing device, the machine processable form of the logical query to query processing engine,
wherein determining the one or more highest intersection cardinality regions within the shape comprises:
generating, by the computing device, an intersection set, the intersection set comprising all shapes that intersect the shape;
determining, by the computing device, a highest intersection cardinality value of the shape;
generating, by the computing device, a highest intersection cardinality index set, the highest intersection cardinality index set comprising all subsets of the intersection set that have a cardinality equal to the highest intersection cardinality value; and
identifying, by the computing device, elements of the highest intersection cardinality index set that contain shapes having a common intersection with each other and with the shape, and
wherein the determining the one or more highest intersection cardinality regions within the shape further comprises:
for each determined highest intersection cardinality region within the shape, appending, by the computing device, a term

OG Complex Work Unit Math
to V such that:

OG Complex Work Unit Math
where:
Si represents a data set corresponding to the shape;
σ represents a set of data sets corresponding to shapes that intersect the shape at the determined highest intersection cardinality region; and
Sj represent respective data sets corresponding to respective elements of σ.