US 12,153,576 B1
Query acceleration for compound disjunctive conditions
Steven Alan Kirk, Chelmsford, MA (US); Mohammed Alkateb, Rancho Palos Verdes, CA (US); and Andreas Michael Kipf, Munich (DE)
Assigned to Amazon Technologies, Inc., Seattle, WA (US)
Filed by Amazon Technologies, Inc., Seattle, WA (US)
Filed on Sep. 29, 2023, as Appl. No. 18/477,934.
Int. Cl. G06F 16/20 (2019.01); G06F 16/2453 (2019.01); G06F 16/2455 (2019.01); G06F 16/248 (2019.01)
CPC G06F 16/24544 (2019.01) [G06F 16/24564 (2019.01); G06F 16/248 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system, comprising:
a plurality of nodes implementing a processing cluster, respectively comprising at least one processor and a memory;
wherein the processing cluster is configured to:
receive a query;
parse the query to identify a disjunctive join condition comprising references to a number of different tables specified in the query, wherein the number of different tables is three or greater, and wherein at least one of disjunct of the disjunctive join condition is a nested conjunction of conditions;
determine for the disjunctive join condition, a condition that refers to less than the number of tables;
generate a plan to perform the query, wherein the query plan comprises one or more operations to:
add a second disjunctive join condition that refers to less than the number of tables;
execute the plan to perform the query; and
return a result of the query.