US5918232A — Multidimensional domain modeling method and system

Claim 1

Independent Claim 209 words

A method of modeling a plurality of variables in a hyperstructure in a computer modeling system having at least one data storage means, a data processing means, input means, and output means, the steps comprising: (A) obtaining measurements of physical objects and activities which are related to the entity to be modeled in the computer hyperstructure; (B) transforming said measurements into computer data which corresponds to the physical objects and activities external to the computer system; (C) constructing a plurality of independent dimensions from said computer data within a hyperstructure, where each dimension has at least one element; (D) creating a plurality of cells, each of which is associated with the intersection of at least two elements, each cell being capable of storing at least one value; (E) associating at least one rule domain with at least one cell, said rule domain including at least one means for assigning values to the associated cells; and (F) preparing a domain modeling rule set which determines which of said assigning means will provide the value associated with each of said cells, wherein the application of said domain modeling rule set to the hyperstructure causes a physical transformation of the data corresponding to said physical objects which are modeled in said hyperstructure.

Claim 2

Independent Claim 209 words

A method of modeling a plurality of variables in a hyperstructure in a computer modeling system having at least one data storage means, a data processing means, input means, and output means, the steps comprising: (A) obtaining measurements of physical objects and activities which are related to the entity to be modeled in the computer hyperstructure; (B) transforming said measurements into computer data which corresponds to the physical objects and activities external to the computer system; (C) constructing a plurality of independent dimensions from said computer data within a hyperstructure, where each dimension has at least one element; (D) creating a plurality of cells, each of which is associated with the intersection of at least two elements, each cell being capable of storing at least one value; (E) associating at least one rule domain with at least one cell, said rule domain including at least one means for assigning values to the associated cells; and (F) preparing a domain modeling rule set which determines which of said assigning means will provide the value associated with each of said cells, wherein the application of said domain modeling rule set to the hyperstructure causes a physical transformation of the data corresponding to said physical objects which are modeled in said hyperstructure.

Claim 3

Dependent Claim 35 words

The method of computer modeling of claim 1 wherein: the means of assigning values in step (E) is a rule selected from the group consisting of User Entered Formulas, autoformulas, User Entered Values, and datamaps.

Claim 4

Dependent Claim 30 words

The method of computer modeling of claim 1, wherein step (F) further comprises: creating a Do Not Aggregate List, a Datamap Rules List, an Autoformula List and a Rules List.

Claim 5

Dependent Claim 38 words

The method of computer modeling of claim 3 wherein step (F) further comprises: (a) gathering the rules; (b) processing the autoformulas; (c) processing the datamaps; (d) ordering the rules; (e) promoting the rules; and (f) processing rule conflicts.

Claim 6

Dependent Claim 102 words

The computer modeling method of claim 4, wherein step (a) includes: (1) building a Do Not Aggregate List; (2) getting the next rule; (3) if the rule is a datamap, then saving the datamap in the Datamap Rules List; (4) if the rule is an autoformula, then adding the rule to the Autoformula List; (5) if the rule is an aggregation, then creating a time summary property rule and adding the time summary property rule to the Rules List; (6) else adding the rule to the Rules List; and (7) repeating steps (2) through (6) until the last rule has been processed.

Claim 7

Dependent Claim 54 words

The computer modeling method of claim 5, wherein step (5) includes: (a) getting the next time summary property (TSP) from the model; (b) creating a new rule for that TSP; (c) adding this new rule to the Rules List; and (d) repeating steps (a) through (c) until all TSPs have been processed, and returning.

Claim 8

Dependent Claim 131 words

The computer modeling method of claim 6, wherein step (c) includes: (i) if the rule is not a list formula, then appending the rule to the Rules List, and returning; (ii) if the rule is a list formula, then fetching the first next element in the rule domain associated therewith; (iii) if said first next element does not have a "Do not aggregate" property, then fetching the second next element; (iv) if said first next element has a "Do not aggregate" property, and said first next element is in this rule's dimension, then fetching the second next element, else removing said first next element from the formula's domain; and (v) repeating steps (ii) through (iv) until all elements have been processed, then appending the rule to the Rules List and returning.

Claim 9

Dependent Claim 69 words

The computer modeling method of claim 4, wherein step (b) includes: (1) getting the next rule in the Autoformula List; (2) if the rule is not in the Time dimension, then adding the rule to the Rules List; (3) else creating a time summary property rule and adding the time summary property rule to the Rules List; and (4) repeating steps (1)-(3) until the last rule has been processed.

Claim 10

Dependent Claim 210 words

The computer modeling method of claim 4, wherein step (c) includes: (1) gathering hierarchies and levels from all dimensions; (2) getting the next rule from the Datamap Rules List; (3) setting all elements and dimensions as valid; (4) getting the next hierarchy; (5) getting the next level; (6) if this level is joinable to the previous level, then (a) if the level is first in its dimension, then turning off all elements in this dimension and adding this level's elements to the rule's domain; (b) if the level is not first in its dimension, then adding the level's elements to the rule's domain; (c) in either case (a) or (b), then (i) if datamap is a low level datamap, then getting the next hierarchy; (ii) if datamap is not a low level datamap, then getting the next level; (7) if this level is not joinable to the previous level, then getting the next level; (8) repeating steps (5), (6) and (7) until all levels in a hierarchy are processed; (9) repeating steps (4)-(8) until all hierarchies in a rule are processed, then turning off all elements not in the table's rule domain and adding the rule to the Rules List; and (10) repeating steps (2)-(9) until all rules are processed.

Claim 11

Dependent Claim 67 words

The computer modeling method of claim 4, wherein step (d) includes: (1) getting the next rule from the Rules List; (2) assigning a primary sort value depending on rule type; (3) assigning a secondary sort value depending on rule type; (4) repeating steps (1)-(3) until each rule has been assigned primary and secondary sort values; and (5) ordering the Rules List by primary and secondary sort values.

Claim 12

Dependent Claim 157 words

The computer modeling method of claim 4, wherein step (e) includes: (1) establishing a Trigger List; (2) getting the next rule from the Rules List; (3) if the rule is a user entered value, or a user entered formula, then adding the rule to the Trigger List; (4) else getting the next rule from the Rules List; (5) repeating steps (2)-(4) until the last rule has been processed; (6) getting the next rule from the Trigger List; (7) getting the next autoformula from the Autoformula List; (8) computing the affected elements from the autoformula's dimension which are superceded by the Trigger List to make a modified autoformula list; (9) repeating steps (6) and (7) until all autoformulas are processed; (10) getting the next autoformula from the modified autoformula list; (11) creating a promoted autoformula rule; (12) repeating steps (10) and (11) until all autoformulas are processed; and (13) repeating steps (6)-(12) until all rules have been processed.

Claim 13

Dependent Claim 150 words

The computer modeling method of claim 4, wherein step (f) includes: (1) getting the next rule from the Rules List; (2) creating a check set consisting of all user entered values with equal specificity; (3) creating a check set consisting of all high priority rules with equivalent specificity; (4) creating a check set consisting of all non-commutative rules with low priority with equivalent specificity; (5) creating a check set consisting of all remaining commutative, low priority rules with equivalent specificity from the same dimension; (6) if any rule's domain intersects any rules in the check sets, then inserting a conflict rule with a rule domain equal to the intersection region ahead of the rule in the list, and saving references to the conflict rule; (7) if there is no intersection, then getting the next rule from the Rules List; and (8) repeating steps (1)-(7) until all rules have been processed.

Claim 14

Dependent Claim 29 words

The method of computer modeling of claim 1, the steps further comprising: (G) providing a computer data manipulation language suitable for expressing queries to obtain data from a hyperstructure.

Claim 15

Dependent Claim 30 words

The method of computer modeling of claim 1, the steps further: (H) providing a user interface means by which the method of calculation of each cell value can be observed.

Claim 16

Independent Claim 218 words

A method of querying a multidimensional computer modeling data structure in a computer system having at least one data storage means, data processing means, input means, output means, a hyperstructure constructed in one of said data storage means, a calculation engine, a domain modeling rule set preparation module, a query engine, and an evaluator which communicates with an SQL generator, a math library, a cache retrieval device and a sort and search processor, comprising the steps of: (A) inputting a query; (B) parsing the query; (C) creating a query component tree; (D) inputting model metadata into said domain modeling rule set preparation module; (E) generating a domain modeling rule set from said domain modeling rule set preparation module; (F) inputting said domain modeling rule set into said calculation engine; (G) generating an execution tree with rules from said calculation engine; (H) inputting said execution tree with rules to said query engine; (I) generating an optimized execution tree from said query engine; (J) inputting said optimized execution tree to said evaluator; (K) communicating between said evaluator and a data reference means; (L) generating an execution tree with results; (M) repeating steps (C)-(L) if there had been any inner queries presented before the query as a whole can be addressed; (N) packaging the query results; and (O) outputting query results.

Claim 17

Independent Claim 218 words

A method of querying a multidimensional computer modeling data structure in a computer system having at least one data storage means, data processing means, input means, output means, a hyperstructure constructed in one of said data storage means, a calculation engine, a domain modeling rule set preparation module, a query engine, and an evaluator which communicates with an SQL generator, a math library, a cache retrieval device and a sort and search processor, comprising the steps of: (A) inputting a query; (B) parsing the query; (C) creating a query component tree; (D) inputting model metadata into said domain modeling rule set preparation module; (E) generating a domain modeling rule set from said domain modeling rule set preparation module; (F) inputting said domain modeling rule set into said calculation engine; (G) generating an execution tree with rules from said calculation engine; (H) inputting said execution tree with rules to said query engine; (I) generating an optimized execution tree from said query engine; (J) inputting said optimized execution tree to said evaluator; (K) communicating between said evaluator and a data reference means; (L) generating an execution tree with results; (M) repeating steps (C)-(L) if there had been any inner queries presented before the query as a whole can be addressed; (N) packaging the query results; and (O) outputting query results.

Claim 18

Dependent Claim 49 words

The method of querying of claim 15, wherein: said data reference means is selected from the group consisting of an SQL generator which communicates with a Relational Database Management System, a math library, a sort and search processor, and a cache retrieval means which communicates with a multi-dimension cache.

Claim 19

Dependent Claim 40 words

The method of querying of claim 15, wherein step (E) further comprises the steps of: (a) gathering the rules; (b) processing the autoformulas; (c) processing the datamaps; (d) ordering the rules; (e) promoting the rules; and (f) processing rule conflicts.

Claim 20

Dependent Claim 191 words

A computer system for modeling a plurality of variables in a hyperstructure comprising: at least one data storage means; data processing means; input means; output means; measurements of physical objects and activities which are related to the entity to be modeled in the computer hyperstructure which are transformed into computer data which corresponds to the physical objects and activities external to the computer system; a plurality of independent dimensions within the hyperstructure constructed from said data, where each dimension has at least one element; a plurality of cells, each of which is associated with the intersection of at least two elements, each cell being capable of storing at least one value; at least one rule domain associated with at least one cell, each said rule domain including at least one means for assigning values to the associated cell; and a domain modeling rule set for determining which of said assigning means will provide the value associated with each of said cells, wherein the application of said domain modeling rule set to the hyperstructure causes a physical transformation of the data corresponding to said physical objects which are modeled in said hyperstructure.

Claim 21

Dependent Claim 191 words

A computer system for modeling a plurality of variables in a hyperstructure comprising: at least one data storage means; data processing means; input means; output means; measurements of physical objects and activities which are related to the entity to be modeled in the computer hyperstructure which are transformed into computer data which corresponds to the physical objects and activities external to the computer system; a plurality of independent dimensions within the hyperstructure constructed from said data, where each dimension has at least one element; a plurality of cells, each of which is associated with the intersection of at least two elements, each cell being capable of storing at least one value; at least one rule domain associated with at least one cell, each said rule domain including at least one means for assigning values to the associated cell; and a domain modeling rule set for determining which of said assigning means will provide the value associated with each of said cells, wherein the application of said domain modeling rule set to the hyperstructure causes a physical transformation of the data corresponding to said physical objects which are modeled in said hyperstructure.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2002-06-28	2002-12-28	2003-06-29	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2006-06-28	2006-12-28	2007-06-29	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2010-06-28	2010-12-28	2011-06-29	$7700.00	Window Closed / Lapsed

Multidimensional domain modeling method and system

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag