Abstract: A computer program file or a sequence of processing steps from an authoring environment of a data processing system is used to generate a graph including nodes representing the processing steps is generated. Unique identifiers (tags) are assigned to the nodes. One or more processing steps are optionally modified while preserving the original identifiers. If an error occurs during execution, error information is saved including the processing step that failed and data records that triggered the failure. The identifier of the failed processing step is attached to the error information. The error information is collected and processed. The collected error information is used to correlate the error to the failed processing step and to data records triggering the error using the identifier of the failed processing step recorded with the error information. The correlated error information indicates cause and location of the error.

Abstract: A method for generating a smaller dataset from a larger dataset, each dataset holding a plurality of records, includes profiling the larger dataset to identify a plurality of patterns, each of which is descriptive of one or more records held in the larger dataset. A plurality of slots of the smaller dataset is filled with records held in the larger dataset. Multiple records held in the larger dataset are individually retrieved, and for each retrieved record it is determined whether to place the retrieved record into a slot of the smaller dataset and evict a record already occupying that slot, or not place the retrieved record into the smaller dataset. This determination is based on a pattern of the retrieved record and a representation status of the pattern in the smaller dataset.

Abstract: A computer program file or a sequence of processing steps from an authoring environment of a data processing system is used to generate a graph including nodes representing the processing steps is generated. Unique identifiers (tags) are assigned to the nodes. One or more processing steps are optionally modified while preserving the original identifiers. If an error occurs during execution, error information is saved including the processing step that failed and data records that triggered the failure. The identifier of the failed processing step is attached to the error information. The error information is collected and processed. The collected error information is used to correlate the error to the failed processing step and to data records triggering the error using the identifier of the failed processing step recorded with the error information. The correlated error information indicates cause and location of the error.

Abstract: Updating graphical user interface elements. A method includes accessing a graphical user interface which includes an initial view including graphical elements. Each of the following are performed (in order) if determined to be applicable: (1) updating in the graphical user interface any pan elements that are outside of the initial view; (2) animating any changes in axes of the graphical user interface to set the stage for data modifications; (3) performing any data element animations in the graphical user interface, including any moves, any additions, any removals and any changes for all updates except those already added in when updating any pan elements that are outside of the initial view and pan element removals that will not be visible in a final view; (4) animating any changes in the axes to the final view; and (5) updating any remaining elements that are now out of view.

Abstract: A computer program file or a sequence of processing steps from an authoring environment of a data processing system is used to generate a graph including nodes representing the processing steps is generated. Unique identifiers (tags) are assigned to the nodes. One or more processing steps are optionally modified while preserving the original identifiers. If an error occurs during execution, error information is saved including the processing step that failed and data records that triggered the failure. The identifier of the failed processing step is attached to the error information. The error information is collected and processed. The collected error information is used to correlate the error to the failed processing step and to data records triggering the error using the identifier of the failed processing step recorded with the error information. The correlated error information indicates cause and location of the error.

Abstract: A method for generating a smaller dataset from a larger dataset, each dataset holding a plurality of records, includes profiling the larger dataset to identify a plurality of patterns, each of which is descriptive of one or more records held in the larger dataset. A plurality of slots of the smaller dataset is filled with records held in the larger dataset. Multiple records held in the larger dataset are individually retrieved, and for each retrieved record it is determined whether to place the retrieved record into a slot of the smaller dataset and evict a record already occupying that slot, or not place the retrieved record into the smaller dataset. This determination is based on a pattern of the retrieved record and a representation status of the pattern in the smaller dataset.

Abstract: A computer program file or a sequence of processing steps from an authoring environment of a data processing system is used to generate a graph including nodes representing the processing steps is generated. Unique identifiers (tags) are assigned to the nodes. One or more processing steps are optionally modified while preserving the original identifiers. If an error occurs during execution, error information is saved including the processing step that failed and data records that triggered the failure. The identifier of the failed processing step is attached to the error information. The error information is collected and processed. The collected error information is used to correlate the error to the failed processing step and to data records triggering the error using the identifier of the failed processing step recorded with the error information. The correlated error information indicates cause and location of the error.

Abstract: Adding new nodes to a graph diagram. A set of one or more new nodes is identified from a graph to be added to an existing graph diagram. A set of one or more anchor candidate nodes are identified in the graph that are coupled to the nodes in the set of one or more new nodes. One of the nodes in the set of one or more anchor candidate nodes is selected as an anchor node. An automatic graph diagram layout of the anchor node and new nodes that are to be coupled to the anchor node is performed to create a disjoint graph diagram. A spatial offset from the anchor node to each of the new nodes coupled to the anchor node in the disjoint graph diagram is identified. Each of the new nodes is added to the existing graph diagram while maintaining the identified spatial offsets.

Abstract: Adding new nodes to a graph diagram. A set of one or more new nodes is identified from a graph to be added to an existing graph diagram. A set of one or more anchor candidate nodes are identified in the graph that are coupled to the nodes in the set of one or more new nodes. One of the nodes in the set of one or more anchor candidate nodes is selected as an anchor node. An automatic graph diagram layout of the anchor node and new nodes that are to be coupled to the anchor node is performed to create a disjoint graph diagram. A spatial offset from the anchor node to each of the new nodes coupled to the anchor node in the disjoint graph diagram is identified. Each of the new nodes is added to the existing graph diagram while maintaining the identified spatial offsets.

Abstract: Adding new nodes to a graph diagram. A set of one or more new nodes is identified from a graph to be added to an existing graph diagram. A set of one or more anchor candidate nodes are identified in the graph that are coupled to the nodes in the set of one or more new nodes. One of the nodes in the set of one or more anchor candidate nodes is selected as an anchor node. An automatic graph diagram layout of the anchor node and new nodes that are to be coupled to the anchor node is performed to create a disjoint graph diagram. A spatial offset from the anchor node to each of the new nodes coupled to the anchor node in the disjoint graph diagram is identified. Each of the new nodes is added to the existing graph diagram while maintaining the identified spatial offsets.

Abstract: Adding a new disjoint graph diagram to an existing graph diagram. A set of one or more new nodes from a graph to be added to a first graph diagram are identified. An automatic graph diagram layout of the set of one or more new nodes is performed creating a second graph diagram. The first graph diagram is aligned along a first axis with the second graph diagram Nodes in the first graph diagram that are at least partially between a first point and a second point of boundaries of the second graph diagram are identified. A boundary is created around the nodes in the first graph diagram that are between the first and second points. The second graph diagram is moved along a second axis toward the boundary to create a combined graph diagram.

Abstract: Adding a new disjoint graph diagram to an existing graph diagram. A set of one or more new nodes from a graph to be added to a first graph diagram are identified. An automatic graph diagram layout of the set of one or more new nodes is performed creating a second graph diagram. The first graph diagram is aligned along a first axis with the second graph diagram Nodes in the first graph diagram that are at least partially between a first point and a second point of boundaries of the second graph diagram are identified. A boundary is created around the nodes in the first graph diagram that are between the first and second points. The second graph diagram is moved along a second axis toward the boundary to create a combined graph diagram.

Abstract: Adding new nodes to a graph diagram. A set of one or more new nodes is identified from a graph to be added to an existing graph diagram. A set of one or more anchor candidate nodes are identified in the graph that are coupled to the nodes in the set of one or more new nodes. One of the nodes in the set of one or more anchor candidate nodes is selected as an anchor node. An automatic graph diagram layout of the anchor node and new nodes that are to be coupled to the anchor node is performed to create a disjoint graph diagram. A spatial offset from e anchor node to each of the new nodes coupled to the anchor node in the disjoint graph diagram is identified. Each of the new nodes is added to the existing graph diagram while maintaining the identified spatial offsets.

Abstract: Updating graphical user interface elements. A method includes accessing a graphical user interface which includes an initial view including graphical elements. Each of the following are performed (in order) if determined to be applicable: (1) updating in the graphical user interface any pan elements that are outside of the initial view; (2) animating any changes in axes of the graphical user interface to set the stage for data modifications; (3) performing any data element animations in the graphical user interface, including any moves, any additions, any removals and any changes for all updates except those already added in when updating any pan elements that are outside of the initial view and pan element removals that will not be visible in a final view; (4) animating any changes in the axes to the final view; and (5) updating any remaining elements that are now out of view.

Abstract: The present invention provides a conversion method for converting numeric multi-dimensional database dimension members to textual representations. The conversion is specifically designed to enable the textual representations of the numeric dimension members to be properly sorted and converted back into numeric representations with accuracy. All numeric and date data is transformed during conversion, such that the textual representation of the numeric and date data is properly sorted as a text string, in the same order as it would be sorted as a number. The present invention also provides a means for accurate reverse-conversion (i.e., from textual representation to numeric representation) by first converting into text the information necessary to support the precision required by the relevant convention of the numeric representation. The present invention also provides a convention for determining the data type of the textual representations of values of various data types.

Abstract: Storage and restoration of display state data for a display object having a display state that can be altered by display state changes made to other display objects in a hierarchical data structure where the display state of the display object being stored has more than one superior display object. Display state data storage and restoration can be a process that is consumptive of processor and memory resources. A method and system are provided for efficiently storing and restoring display state data for display objects corresponding to data elements in a complex hierarchical data structure. A sequence number generator is used to track display state changes made to a complex display grid. As display state changes are made, a number is associated with the display state change which is, in turn, associated with a display object.

Abstract: The present invention provides a conversion method for converting numeric multi-dimensional database dimension members to textual representations. The conversion is specifically designed to enable the textual representations of the numeric dimension members to be properly sorted and converted back into numeric representations with accuracy. All numeric and date data is transformed during conversion, such that the textual representation of the numeric and date data is properly sorted as a text string, in the same order as it would be sorted as a number. The present invention also provides a means for accurate reverse-conversion (i.e., from textual representation to numeric representation) by first converting into text the information necessary to support the precision required by the relevant convention of the numeric representation. The present invention also provides a convention for determining the data type of the textual representations of values of various data types.