Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The present disclosure involves systems, software, and computer implemented methods for transitioning between database system sharing types. One example method includes identifying a tenant container that includes a read-only table, a first writable table, and a mixed table for storing read-only and writable data. A shared container is created. A shared table is created in the shared container. Data is copied from the read-only table to the shared table. The read-only table is dropped. A read-only view is created in the tenant container. 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. The mixed table is renamed to be the second writable table. A union view is created that provides unified access to the second shared table and the second writable table.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.