US 11,914,613 B2
Data visibility for nested transactions in distributed systems
Sarvesh Singh, Issaquah, WA (US); Alan Dale Halverson, Verona, WI (US); Sandeep Lingam, Redmond, WA (US); and Srikumar Rangarajan, Sammamish, WA (US)
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Mar. 31, 2021, as Appl. No. 17/219,007.
Prior Publication US 2022/0318263 A1, Oct. 6, 2022
Int. Cl. G06F 16/27 (2019.01); G06F 9/46 (2006.01); G06F 16/901 (2019.01)
CPC G06F 16/27 (2019.01) [G06F 9/466 (2013.01); G06F 16/9024 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
a distributed query processor and a plurality of compute nodes;
the distributed query processor configured to:
generate a directed acyclic graph comprising vertices, each of which are nested in a statement-level transaction having a statement-level identifier, and each of which include at least one task;
generate:
a vertex-level nested identifier, respectively, of a set of the vertices scheduled for parallel processing and of ones of the vertices scheduled for individual processing, and
a task-level nested identifier, respectively, for each task nested in each of the vertices; and
distribute, to the plurality of compute nodes, portions of the at least one task of the vertices causing an initiation of execution of the distributed portions at the plurality of compute nodes according to data visibility rules for the data that are based at least on the statement-level identifier, each respective vertex-level identifier, and each respective task-level identifier.