Instruction level parallelism in a declarative graph query language
AssigneeMicrosoft Technology Licensing, LLC
InventorsAnders Tungeland Gjerdrum, Tor Kreutzer, Jan-Ove Almli Karlberg
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Technology Licensing, LLC
InventorsAnders Tungeland Gjerdrum, Tor Kreutzer, Jan-Ove Almli Karlberg
Estimating the term…
Example solutions for executing a query in a declarative graph query language include receiving the query for data in a database and determining if one or both of i) a pattern in the query, and ii) the data in the database render the query suitable for being executed, at least in part, in parallel. If either condition indicates that the query is suitable for being executed, at least in part, in parallel, one or more fork operations and join operations are injected into a query plan, and the query is executed according to the query plan. Some examples further determine whether executing the query in parallel is computing resource-efficient, and only executes computing resource-efficient queries in parallel.
A system for executing a query, the system comprising:
A method for executing a query, the method comprising:
One or more hardware computer storage devices having computer-executable instructions stored thereon, which, on execution by a computer, cause the computer to perform operations comprising:
Dependencies are inferred from the claim text.