Abstract: A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

Abstract: A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

Abstract: A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

Abstract: An N-dimensional material planning method for evaluating supplier material policy includes steps for storing supplier characterization data in a N-dimensional data space, and evaluating the supplier characterization data using predetermined rules to thereby generate at least one of a current policy assessment and a recommended policy goal. Moreover, the method includes a further step for analyzing the predetermined rules upon which the at least one of the current policy assessment and the recommended policy goal are based. According to an aspect of the present invention, the evaluating step uses predetermined rules including binary rules and weighting rules to generate the at least one of the current policy assessment and the recommended policy goal, where the binary rules have precedence over the weighting rules. A computer system and a storage medium for carrying out and storing computer readable instructions, respectively, pertaining to the N-dimensional material planning method are also described.