Sap Se

Sap Ag

Ralf Dentzer

Timm Falter

Daniel Buchmann

Karsten K Bohlmann

Stefan Kusterer

Frank Mock

Tobias Stein

Klaus Nottbohm

Udo Peter Klein

Uwe Schlarb

Bernhard Thimmel

Matthias Richter

Daniel Zoch

Axel Herbst

Gisella Dominguez Anzuinelli

Georg Dopf

Thomas Moser

Andreas Bold

Dirk Richtsteiger

Friedhelm Krebs

Detlef Pluemper

Stefan Hirschenberger

Ralf Krenzke

Karsten Bohlmann

Techniques and solutions are described for storing and retrieving metadata for database artefacts. A client request is received that includes a relevancy identifier. The relevancy identifier is useable to determine a subset of metadata that should be provided in response to the request. Metadata, including in metadata objects or database artefacts, can be reviewed to determine whether it is relevant to the request, such as if the metadata is associated with the relevancy identifier. Different requests from the same client can specify different relevancy identifiers, as, for example, a first set of metadata may be relevant to one client process and another set may be relevant to another client process. While some metadata can be specific to a particular client, at least some of the metadata can be accessed by multiple clients, and at least in some cases different clients can specify the same relevancy identifier.

Centralized metadata repository with relevancy identifiers

Techniques and solutions are described for retaining names for metadata elements, such as when metadata is imported, converted to a different format, or used with a system that may have restrictions on naming different than a system on which the metadata is created. Metadata includes a plurality of metadata elements, including a first metadata element associated with a first name. A second name is received for the first metadata element. The second name is assigned to the first metadata element. An association is created between the renamed first metadata element and the first name.

Metadata elements with persistent identifiers

The present disclosure relates to computer-implemented methods, software, and systems for automatic database configuration. One example method includes receiving, at a database associated with a data warehouse application, a request to generate a configuration to acquire data objects based on executing calls to corresponding programming interfaces provided by a source application, wherein the programming interfaces are identified in the received instructions and are associated with acquiring the data objects associated with metadata entities defined at the database; in response to the received instructions, configuring the database to automatically execute one or more calls to acquire relevant data for a metadata entity defined at the database, wherein the metadata entity is associated with a section of a first programming interface; and invoking the first programming interface at the source application, wherein invoking the first programming interface results in acquiring the relevant data.

Automatic configuration of data invocation from one or more sources based on metadata mappings

The present disclosure relates to computer-implemented methods, software, and systems for processing hierarchies of data. A first changeable version of a current hierarchy of nodes is created to refer to a current stable version and to a first set of new relations associated with changes in a first set of relations between entities in the current stable version is response to a received first instruction. A second instruction to adjust the current stable version is received from a second user. In response to receiving the second instruction, a second changeable version of the current hierarchy of nodes is created. The second changeable version refers to the first changeable version and to a second set of new relations associated with changes in a second set of relations between entities in the first changeable version. A new stable version of a new current hierarchy of nodes is generated.

Processing hierarchical relational data

A visual depiction of a hierarchy stored at a server computer can be presented at a client computer that interacts with the server computer as operations are performed on the hierarchy. Efficient execution of operations and determination of which nodes are visible within the hierarchy can be supported without sending the entire hierarchy back and forth between the client and the server. Drill state in the user interface can be preserved during operations. The server can support multiple clients interacting with the hierarchy at the same time.

User interface support for large hierarchies

A database includes a plurality of partitions with respective partition dates. A query is received for data from a view of the database, the query containing a filtering parameter for retrieval of the data. A definition of the view is analyzed to determine a table of the database that contributes to the view and an aging object associated with the table. A restriction rule associated with the aging object is identified, for example, based on an annotation in the definition of the view. A restriction date for the aging object is determined based on the restriction rule. A partition, from the plurality of partitions, is selected based on the partition date of the partition being equal to or later than the restriction date. The queried data is retrieved from the selected partition according to the filtering parameter and a response to the query is generated based on the retrieved data.

Optimizing data access based on data aging

A method and system for time dependent search is described. A search manager may receive a query for time dependent information relating to a base object and a time period. The search manager may search a search optimized storage system of technical objects for a technical object that matches the query. Each technical object may include a reference to time dependent information stored by a base object and a validity period. The validity period for each technical object is chosen by time stretching logic such that valid time dependent information is available for all time periods.

Method, article and system for time dependent search

A core system including different program components performing distinct tasks in a workflow sequence that are initiated through status field updates of objects in database may be modified to define a new status triggering additional processes in an action management system. Once the additional processes are completed, the status field may be changed to an original status provided by the core system to trigger a second program component in the workflow sequence. The action management system may contain user customized processes that may be modified and changed independent of the functionality provided by the core system.

Extensibility of business process and application logic

A computer implemented method for providing code list extensibility includes providing a first code data type representation. The first code data type representation corresponding to a first code data type and having a first code value representation for at least one code value. The at least one code value associated with a corresponding code value issuing entity. The method may also include providing a second code data type representation. The second code data type representation corresponding to the first code data type and having a second code value representation for the at least one code value. The second code value representation including a unique identifier associated with the code value issuing entity. The method also may include mapping the first code data type representation and the second code data type representation based at least in part on the unique identifier associated with the code value issuing entity.

Providing code list extensibility

A coarse evaluation lock on data is provided to ensure only one evaluation is run on selected data until completed. A fine exclusive lock on selected data is provided to ensure only one user may change such selected data. The locks may be selectively used during evaluations and while users are changing data.

Dual granularity locking mechanism

A data model for a supply chain is provided whereby individual working steps in a production process are defined as activities, and organized groups of such activities are defined as orders. Activities are allocated to no more than one resource and contain information concerning the start and finish time for the activity, any resource on which the activity is currently scheduled, and a list of alternative resources, if any. Activities are linked to each other via auxiliary objects, which contain information concerning the minimum and maximum time between activities. Orders may contain input and/or output interface nodes, representing the materials consumed and produced by the offer. Each output interface node representing a quantity of material created from one order is linked via an auxiliary object to respective input interface node or nodes from other orders that are scheduled to receive that material. Order anchors are defined whereby a planning algorithm can easily reference an order by its order number in a database table. Planning object anchors allow the planning algorithm to access all the orders for a given material, and resource anchors permit access to all activities scheduled for that resource.

Growing community of inventors

Hockenheim, Germany

Ralf Dentzer