×

Database calculation using parallel-computation in a directed acyclic graph

  • US 9,576,072 B2
  • Filed: 02/13/2014
  • Issued: 02/21/2017
  • Est. Priority Date: 02/13/2014
  • Status: Active Grant
First Claim
Patent Images

1. A method of database calculation, the method comprising:

  • identifying dependency of tasks;

    converting the identified dependency of tasks into a directed acyclic graph in response to the identified dependency of tasks, wherein the directed acyclic graph topologically orders the tasks into layers of tasks; and

    performing the database calculation, wherein the database calculation computes in parallel the tasks in each layer of the layers of tasks, wherein the performing the database calculation further comprises selecting a first set of nodes in a topological ordering of the directed acyclic graph, performing parallel-computation of the tasks in the selected first set of nodes, selecting a second set of nodes, performing parallel computation of the tasks in the selected second set of nodes, and determining if the selected second set of nodes is a root node, wherein in response to a finding of the root node, the parallel-computation of the tasks ends, otherwise, the selecting of another second set of nodes is performed.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×