Sap Se

Sap Ag

Jens Lemcke

Gunther Stuhec

Andreas Friesen

Michael P Dietrich

Piergiorgio Bertoli

Marco Pistore

Bernhard Thimmel

Nathali Ortiz Suarez

Florian Gessner

Otfried Von Geisau

Michael Altenhofen

Daniel Oberle

Thomas Hille

Christian Drumm

Otfried Geisau

Vivek Krishnamurthy Dornal

Egon Boerger

Muhammad Wasimullah Khan

Markus Fronk

Ganapathy Subramanian

Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

Labeling entities in a canonical data model

Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being an extension of a core SAM schema, providing one or more goals, goals representing an intention of the core SAM schema, receiving one or more action chains, action chains representing one or more actions of the extended SAM schema that are to be automatically executed, the one or more actions being associated with triggerability flags, a triggerability flag indicating whether a respective action is only triggerable using a respective action chain, and processing the one or more goals, the one or more action chains and the triggerability flags using a computer-executable model checking tool for evaluating the validity of the extended SAM schema.

Validation of functional correctness of SAM schemas including action chains

Labelling entities in a canonical data model

The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes.

Canonical data model for iterative effort reduction in business-to-business schema integration

Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundancy groups.

User-guided multi-schema integration

Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema, providing one or more goals, each goal representing an intention of the core SAM schema, the one or more goals being provided in a computer-readable document stored in memory and comprising one or more primary goals that each express an intention of a process underlying the core SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the extended SAM schema.

Checking compatibility of extended and core SAM schemas based on complex goals

Methods, systems, and computer-readable storage media for evaluating a validity of a status and action management (SAM) schema. In some implementations, actions include receiving the SAM schema, the SAM schema being stored as a computer-readable document in memory, providing one or more goals, each goal representing an intention of the SAM schema, the one or more goals being provided in a computer-readable document stored in memory and including one or more primary goals and one or more recovery goals that each express an intention of a process underlying the SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the SAM schema.

Verification of status schemas based on business goal definitions

A name of one or more entity classes of the data model may be refined to conform to a naming convention. A semantic meaning of each of the names and one or more attributes of each entity class may be determined. It may be determined that the name of a first entity class is semantically similar to the name of a second entity class based on a semantic distance between the semantic meaning of the names, where a substantial similarity may be determined between the first entity class and the second entity class by comparing the semantic meaning of the one or more attributes of the first entity class to the semantic meaning of the one or more attributes of the second entity class. The data model may be normalized based on the substantial similarity.

Data model optimization

Methods and systems to generate derivative information sources, from original information sources, use an ontology that provides a logic-based representation formalism of each of a number of original information sources, the original information sources having heterogeneous representation formalisms. The original information sources are transformed to the ontology. A number of derivative information sources, corresponding to the original information sources, may be automatically generated from the ontology.

Ontology-based generation and integration of information sources in development platforms

Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.

Computing canonical hierarchical schemas

A mediator system (and associated methods and computer program products) for mediating a communication between a client and a plurality of providers within a network is described. The mediator system may include logical machines including a first receiving machine configured to receive a request message from the client, a first sending machine configured to send answer messages back to the client, a processing machine configured to handle the received request message internally represented as a request object, a second sending machine configured to send outgoing request messages to the providers, and a second receiving machine configured to receive incoming answer messages from the providers. The machines can be scheduled separately from being executed, and the request object may be split into subrequests, where each of those subrequests may be further decomposed into subsubrequests that may be sent out in parallel to the providers.

System and a method for mediating within a network

A system for composing Web services may include a goal determiner unit and a composer unit. The goal determiner unit may be configured to access a primary goal of final states of Web service representations. The composer unit may be configured to compute a set of transitions from initial states of the Web service representations to the primary goal, compute intermediate states of one or more Web service representations, and generate a copy rule of the set of transitions, the copy rule having a condition part that specifies the intermediate states and a portion of the final states of the primary goal and an activity part that includes assignments of input variables consumed by transitions from the intermediate states.

Composition of web services using representations

A computer-implemented method includes receiving a request for a web service and comparing a description of a behavior of the requested web service to a description of a behavior of an existing web service. The description of the behavior of the requested web service and the description of the behavior of the computing service conform to a description logic. Based on logical rules of the description logic, it is determined that the description of the behavior of the existing computing service is subsumed by the description of the behavior of the requested web service.

Growing community of inventors

Karlsruhe, Germany

Jens Lemcke