	US 12,488,051 B2
	Failure tolerant and explainable state machine driven hypergraph execution
Sumeet Priyadarshee Dash, Lake Forest, CA (US); Jose Aguilar Saborit, Bellevue, WA (US); Krishnan Srinivasan, Sammamish, WA (US); Mohammad Shafiei Khadem, Seattle, WA (US); Kevin Bocksrocker, Kirkland, WA (US); Brandon Barry Haynes, Seattle, WA (US); and Raghunath Ramakrishnan, Bellevue, WA (US)
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Sep. 28, 2023, as Appl. No. 18/477,168.
Claims priority of provisional application 63/503,643, filed on May 22, 2023.
Prior Publication US 2024/0394311 A1, Nov. 28, 2024
Int. Cl. G06F 16/903 (2019.01); G06F 16/901 (2019.01)

CPC G06F 16/90335 (2019.01) [G06F 16/9024 (2019.01)]

20 Claims

1. A system, comprising:

a processor; and

a memory device that stores program code structured to cause the processor to:

receive a first user query,

generate an independent first query graph representative of the first user query, the first query graph comprising at least one operator,

enlist the first query graph into a hypergraph containing query graphs that are representative of user queries including the enlisted first query graph,

analyze the hypergraph at least by ordering and reordering execution of operators of the hypergraph, the analysis resulting in a plurality of execution sequences,

select, based at least on the analysis, a first execution sequence of the plurality of execution sequences, and

schedule execution of the first execution sequence.