Sap Se

Sap Ag

Christian Stork

Welf N Walter

Volker Driesen

Uwe Schlarb

Kerstin Hoeft

Immo-Gert Birn

Andreas Blumenthal

Ulrich Auer

Karsten K Bohlmann

Ralf-Juergen Hauck

Torsten Ziegler

Stefan Bresch

Volker Wiechers

Andrea Neufeld

Dirk Debertin

Tobias Wenner

Christoph H K Wedler

Masoud Aghadavoodi Jolfaei

Reiner Singer

Marcel Hermanns

Rolf Hammer

Gerd G Forstmann

Kai Baumgarten

Thilo Boehm

Michael Watzek

Michael Brombach

Markus J Kuefer

Jens Lieberum

Steffen Weinstock

Cornelia Haase

Christoph Stoeck

Andreas Gruenhagen

Kilian Kilger

Frank Becker

Bernd Roedel

Thomas Beissel

Ariane Buster-Zoeller

Sven Kobler

Doris Vielsack

Julius Bettin

The present disclosure involves systems, software, and computer implemented methods for key pattern management. One example method includes receiving a query for a logical database table from an application. A determination is made as to whether the query is a write query. In response to determining that the query is a write query, a determination is made as to whether the query complies with a key pattern configuration that describes keys of records included in a physical database table that is part of a logical table implementation. The physical table includes records of the logical database table that are allowed to be written by the application. The write query is redirected to the physical database table in response to determining that the query complies with the key pattern definition. The query is rejected in response to determining that the query does not comply with the key pattern configuration.

Key pattern management in multi-tenancy database systems

Provided are systems and methods of a compiler that efficiently processes semantic analysis. For example, the compiler may perform semantic analysis on as much of the source code as possible during compile time. For any instructions, such as dynamic expressions, that are not known at compile time, the compiler may encode semantic bytecode for performing the semantic checks on such dynamic expressions, and their dependent expressions, during execution/runtime of the program. In one example, the method may include compiling source code of a program into bytecode, identifying, during the compiling, a dynamic expression that includes one or more dependent static expressions within the source code, generating semantic bytecode for semantic analysis of the one or more dependent static expressions of the dynamic expression, and adding the semantic bytecode to the bytecode of the program.

Efficient semantic analysis of program code

The present disclosure teaches solutions for transitioning between database system sharing types. In one example, a tenant container includes a read-only table, a first writable table, and a mixed table for storing read-only and writable data. When transitioning to a sharing setup, a shared container is created and a shared table is created in the shared container. Data is copied from the read-only table to the shared table and the read-only table is dropped. A read-only view is created in the tenant container and a second shared table is created in the shared container. Read-only mixed data is copied from the mixed table to the second shared table and deleted from the mixed table, and after the deletion, the mixed table is renamed as the second writable table. A union view is created that provides unified access to the second shared table and the second writable table.

Transitioning between system sharing types in multi-tenancy database systems

The present disclosure involves systems, software, and computer implemented methods for enabling multiple system sharing types in multi-tenancy database systems. One example method includes determining a system sharing type configuration for a database system. The system sharing type configuration is one of standard, shared, tenant, or simulated. Tables are created in the database system based on the system sharing type configuration and the table sharing type of each table. Content is deployed to created tables in the database system based on the system sharing type configuration and the table sharing type of each table. Access is provided to at least one application to the database system based on the system sharing type configuration and the table sharing type of each table.

System sharing types in multi-tenancy database systems

The present disclosure involves systems, software, and computer implemented methods for data separation and write redirection in multi-tenancy database systems. One example method includes providing access to at least one application to a database system. A query is received from an application. A determination is made that the query is associated with a union view that provides unified access to a first read-only table in a shared database container and a first writable table in a tenant database container. A determination is made as to whether the query is a read query or a write query. In response to determining that the query is a read query, the query is processed using the union view. In response to determining that the query is a write query, the query is modified to use the first writable table and the query is processed using the writable table.

Data separation and write redirection in multi-tenancy database systems

A table can be replaced with a view transparently to the application. For example, a data dictionary can specify that the view is to be substituted for the table. At runtime, application operations on the table are redirected to be performed on the view. Validation can be performed to ensure congruence between the table and the view. Can be useful for situations where a view with enhanced functionality is desired to be used in place of the table without re-coding the application.

Transparent database table replacement

A mesh structure can be a type concept that extends internal tables or other data structures of a business programming languages (e.g., ABAP) by associations, as known from a data object meta-model. A mesh can include a set of operations, such as for example iteration via an iterator object and selection of instances expressed by a path language. A mesh structure can be optimized for read access and traversal, and can provide a working area that is processed with statements in the business programming language to implement one or more core services directly from the mesh data structure. Related methods, computer program products, and systems are described.

Native language support for intra-and interlinked data collections using a mesh framework

A new query language can be embedded in a business application programming language (e.g., the ABAP language). A query language consistent with implementations of the current subject matter can be based on a graph data-model of connected business objects (BO) or other data objects and can be designed as an efficient query language embedded into the business application programming language runtime, thereby allowing expression of business logic in a declarative manner.

Advanced business query language

A system, a method, and a computer program product for in-memory database processing are provided. A business object is generated in a first system. The generated business object is replicated from the first system to a second system. A high performance application implementing the replicated business object is executed based on at least one system specific view.

Systems and methods for in-memory database processing

Methods and systems are described that involve determining the memory consumption of a specific application. The memory analysis identifies the dynamic memory objects controlled by a particular application and the memory objects controlled by the framework running that application. A structured view of the memory objects of the framework with respect to the individual framework architecture is presented in combination with the application specific memory object graph. A resulting display, in the form of a dominator tree, allows detecting dependencies of the application to the framework and shows which part of the framework is responsible for keeping alive which part of the application. Moreover, the resulting structure shows memory consumption of a single element of the application including bound memory and object memory. Further, a user can identify the references and the dependencies among the memory objects.

Application specific memory consumption and analysis

According to some embodiments, a programming language in an application server may access different database server implementations, wherein the programming language accesses content of database tables via work areas derived from the database tables. A database table may be mapped to a work area such that each column in the database table is mapped to a corresponding component of the work area (having a default component type based on the column type of the associated column). It may be determined that a particular column in the database table is to store large object data content, and a new mapping to a work area may be defined such that a particular column maps to a corresponding component having a component type other than the default component type.

Systems and methods for mapping large object data content in a database table to a work area

According to some embodiments, a programming language in an application server may include access to different database server implementations, wherein the programming language accesses content of database tables via work areas derived from the database tables. A database table, having columns to store content, each column being associated with a column type, may be mapped to a work area such that, at a database server, each column in the database table is mapped to a corresponding component of the work area, the corresponding component having a default component type based on the column type of the associated column in the database table. It may be determined that a particular column in the database table is to store large object data content, and, in response to the determination, a new mapping to a work area may be defined such that the particular column maps to a corresponding component having a component type other than the default component type.

Systems and method for mapping large object data content in a database table to a work area

A system and method are described for performing a mapping between persistent data objects and a database. For example, a method according to one embodiment of the invention comprises determining whether an attribute having a generic type is an instance of a persistent class; and if the attribute is an instance of a persistent class, then mapping the attribute to a discriminator column holding the type associated with the attribute and further mapping the attribute to a reference column holding a key associated with the attribute.

Object-relational mapping system and method for generic relationships

An application system includes a first process configured to execute an application program, wherein the application program is operable to use a set of data structures. The application system also includes a second process configured to interpret a markup language document. A transformation template is configured to specify a symmetric mapping between the markup language document and the set of data structures. A transformation virtual machine runs in association with the first process and is operable to execute the transformation template. The transformation virtual machine is operable to perform a symmetric transformation between the markup language document and the set of data structures to allow the first process and the second process to exchange information.

Symmetric transformation processing system

Growing community of inventors

Boenen, Germany

Christian Stork