Sap Ag

Sap Se

Sap Aktiengeselleschaft

Winfried Schwarzmann

Gregor Rieken

Stephan Toebben

Gerhard Himmelsbach

Jochen Schrempf

Holger Kiefhaber

A method, a system, and a computer program product for generating test infrastructure for testing of software applications are disclosed. At least one first method associated with an application is determined. A testing version of a second method associated with the application is generated. The first method calls a runtime version of the second method during execution of the application in a runtime environment. The first method is tested using the testing version of the second method in a testing environment associated with the application.

Generating a test version of a method to be called during runtime and fulfilling a collaboration contract

The present description refers to a computer implemented method, computer program product, and computer system to store a node dependency network that includes a plurality of data nodes and one or more links between two or more data nodes, each link representing a data dependency between instances of the two or more data nodes, to forward a requested change to a first data node from a first change control component to a change control manager, identify, by the change control manager based upon the links within the node dependency network, one or more dependent data nodes that are dependent upon the first data node, and determine one or more dependent changes to be performed to one or more instances of the dependent data nodes to maintain consistency among instances of the data nodes.

Data change management through use of a change control manager

A system and method for an ultimate locking mechanism which minimizes a lock period for modifying shared data in a shared database. A process is executed as one or more initial instances and a final instance. Each initial instance reads the shared data from the shared database without acquiring a lock on the shared database. The locking mechanism obtains results that are directed to modifying the shared data and buffers the results at least partially. During or after each of the initial instances, it determines whether the next instance is to be the final one (e.g., the estimated runtime of the next instance is acceptable as the lock period). In response to a positive determination, the final instance of the process is executed. The final instance uses at least one of the buffered results during execution and acquires the lock on the shared database to modify the shared data.

Ultimate locking mechanism

A method of analyzing a path by defining a plurality of contiguous geographical regions, each to have a uniform value of a characteristic affecting travel through the region and evaluating the path from a point in an origin region through an intermediate region to a point in a destination region. Related methods and means of representing paths, and systems to implement the methods are also described and claimed.

System and method for trip routing with configurable constraints

Method and apparatus for enabling the user to guide the synchronization of a source data structure with a target data structure. The guided synchronization stores the operations defined by the user and reapplies them to future synchronizations.

Guided structure synchronization

A system and method for visualizing a plural dimensional data. One of a plurality of potential visualization formats is selected in a processor for each dimension of a plural dimensional data set. The selected visualization format is used to display the associated dimension on an electronic display. User interface elements are provided to navigate between elements of the plural dimensional data set within the displayed visualization format.

System and method for visualizing parameter effective data sets

Embodiments of the invention are generally directed to a system and method for the assembly of a program having one or more methods. In an embodiment, one or more sequences for the methods of the program are determined based, at least in part, on data format information provided by the methods. In one embodiment, one of the sequences is selected based, at least in part, on a data format efficiency computation.

System and method for the assembly of programs

Method and apparatus for trip routing with configurable constraints

The invention relates to an object-oriented technique for representing and accessing application data that is arranged in hierarchical relationships. In a first step classes are provided including a hierarchy base class with methods for accessing hierarchical relationships, at least one hierarchy subclass that is derived from the hierarchy base class, and at least one application class. In a next step objects are instantiated including at least one hierarchy object of the at least one hierarchy subclass and at least one application object of the at least one application class. In a final step, each application object is linked to at least one hierarchy object, and vice versa, to provide access to the application data.

Systems, methods, and articles of manufacture for handling hierarchical application data

A flexible transportation optimization approach is described that can easily be implemented on multi-tiered computer systems and that does not unnecessarily consume processing and memory resources. On a database tier a data model is defined. The data model comprises master data including a state set with a plurality of states representative of physical sites or conditions of a physical entity, wherein each state is assigned to exactly one hierarchy level and wherein to each state zero, one or a plurality of states of lower hierarchy levels are assigned and a transition set with transitions from one state to a state on the same or on a different hierarchy level. On an application tier, a processor performs for at least one given source state and at least one given destination state, repeatedly steps of generating a graph having a plurality of states as vertices, transitions and hierarchical relationships among states as edges, and a cost function, and of subjecting the graph to a path optimization mechanism outputting multiple paths from the at least one source state to the at least one destination state that heuristically influence the generation of the succeeding graph, wherein the one or more solution paths are included in the paths generated during the last repetition.

Systems, methods, and articles of manufacture for flexible path optimization

Memory-efficient techniques are disclosed for the dynamic retrieval of assignments concerning, for example, the transportation of goods or information between discrete transportation states (such as coordinates of geographical sites or IP addresses of different computers) is described. Embodiments of the invention allow to dynamically determine from the master data, for an element g of the input set G (e.g., transportation states), an application assignment set A(g) of elements (m,p) of the Cartesian product of the condition set M (e.g., transportation constraints) and the value set P (data associations), taking into account the hierarchical organization of the input set G and the condition set M. The data assignment set A(g) may be processed by transportation path optimization mechanisms.

Growing community of inventors

Waghaeusel, Germany

Winfried Schwarzmann