CLUSTER PROCESSING OF A CORE INFORMATION MATRIX

• US 20080270363A1
• Filed: 01/31/2008
• Published: 10/30/2008
• Est. Priority Date: 01/26/2007
• Status: Abandoned Application

• Current Assignee: Symphonyiri Group Incorporated (New Mountain Capital Group LLC)
• Original Assignee: Symphonyiri Group Incorporated (New Mountain Capital Group LLC)
• Inventors: Bergeon, Cheryl G., Hudson, Gregory David Neil, Basilico, Andrea, Gibbs, Marshall Ashby, Chapa, Craig Joseph, Yusko, Jay Alan, Griglione, Bradley Michael, Mason, Trevor, Hunt, Herbert Dennis, Agostinelli, Alberto, West, John Randall, Johnson, Arvid Conrad
• Application Number:
  US12/023,400
• Publication Number:
  US 20080270363A1
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/24556 Aggregation; Duplicate elimination
• CPC Class Codes: G06F 16/2462 Approximate or statistical queries

Abstract

Systems and methods are presented that may involve storing a core information matrix in a partition within a partitioned database, wherein the partition is associated with a data characteristic. It may also involve associating a master processing node with a plurality of slave nodes, wherein each of the plurality of slave nodes is associated with a partition of the partitioned database. It may also involve submitting a query to the master processing node, wherein the query relates to a projection. It may also involve assigning analytic processing to at least one of the plurality of slave nodes by the master processing node, wherein the assignment is based at least in part on the partition association. It may also involve processing the projection-related query by the assigned slave node, wherein the analysis produces a partial projection result at the assigned slave node.

Claims

1. A method comprising:

storing a core information matrix in a partition within a partitioned database, wherein the partition is associated with a data characteristic;

associating a master processing node with a plurality of slave nodes, wherein each of the plurality of slave nodes is associated with a partition of the partitioned database;

submitting a query to the master processing node, wherein the query relates to a projection;

assigning analytic processing to at least one of the plurality of slave nodes by the master processing node, wherein the assignment is based at least in part on the partition association; and

processing the projection-related query by the assigned slave node, wherein the analysis produces a partial projection result at the assigned slave node.

2. The method of claim 1 further comprising combining the partial projection results from each of the plurality of slave nodes by the master processing node into a master projection result.