×

Efficient assignment of query requests between analytical engines of differing complexity

  • US 9,177,036 B2
  • Filed: 12/20/2012
  • Issued: 11/03/2015
  • Est. Priority Date: 12/20/2012
  • Status: Active Grant
First Claim
Patent Images

1. A non-transitory computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

  • receiving a query request from a single user interface via which a user selects a desired set of analytical functions from a presented full range of levels of analytical complexity supported by the plurality of analytical reporting engines;

    analyzing the received query request at runtime to determine a level of analytical complexity required to generate a report responsive to the query request;

    distributing, based on the determined level of analytical complexity, the one or more analysis tasks among a plurality of analytical reporting engines of differing analytical complexity such that a full complexity analytical engine of the plurality of analytical reporting engines is used only for those of the one or more analysis tasks that require capabilities of the full complexity analytical engine;

    distributing, based on the determined level of analytical complexity, those of the one or more analysis tasks that do not require capabilities of the full complexity analytical engine to one or more reduced complexity analytical engines of the plurality of analytical reporting engines, the one or more reduced complexity analytical reporting engines comprising fewer capabilities than the full complexity analytical engine; and

    generating the report based at least in part on output from each of the plurality of analytical engines to which the one or more analytical tasks were distributed.

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