×

OPTIMIZATION OF NON-DETERMINISTIC COMPUTATIONAL PATHS

  • US 20120284315A1
  • Filed: 05/04/2011
  • Published: 11/08/2012
  • Est. Priority Date: 05/04/2011
  • Status: Abandoned Application
First Claim
Patent Images

1. A method for optimizing a non-deterministic computational path, the method comprising:

  • (a) receiving a request to generate a report;

    (b) extracting features and a date range from the request;

    (c) merging data files for each extracted feature to satisfy the requested date range to form a series of data files;

    (d) merging a plurality of series of data files to form a semi-lattice structure;

    (e) identifying an available data file necessary for the report;

    (f) identifying a subsuming data file that subsumes the available data file;

    (g) removing the available data file from processing;

    (h) issuing a transition into the subsuming data file;

    (i) repeating steps (d)-(h) until the structure has been reduced;

    (j) processing subsuming data files needed for the report;

    (k) identifying missing data files needed to complete the report;

    (l) calculating the supremum of all missing data files;

    (m) identifying a solved series of data files with a partial order relation with the supremum of all missing data files;

    (n) issuing a transition into the solved series of data files;

    (o) triggering an entry into the transition;

    (p) processing the missing data files associated with the transition;

    (q) repeating steps (k)-(p) until all missing data files have been processed; and

    (r) generating the report.

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