Sap Se

Sap Ag

Torsten Ziegler

Frank-Martin Haas

Volker Driesen

Uwe Schlarb

Christian Stork

Ulrich Auer

Ralf-Juergen Hauck

Welf N Walter

Immo-Gert Birn

Mihnea Andrei

Stefan A Baeuerle

Arne Harren

Timm Falter

Alexander Boehm

Guenter Briam

Arndt Effern

Tobias Wenner

Rainer Schweigkoffer

Christian Hansen

Markus Gebhard

Bernd Kohler

Andreas Zimmermann

Guenther Drach

Martin Stahl

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

Disclosed herein are system, method, and device embodiments for consuming application-owned database objects via an API schema. An embodiment operates by determining that an application-owned database object is classified as API exposable, creating an API schema for proxy access to database objects that have been identified as API exposable, generating an API object within the API schema based on assigning the database object to the API schema, and providing, via the API schema and independent of the application, access to the API object by a privileged consumer.

Consuming application-owned database objects via SQL

Techniques and solutions are described for facilitating the distribution of tables and table data between a shared container and one or more tenant containers. The tables can include a sharing indicator that can designate a table (or a view on a table) as having a materializable type. Materializable types can initially be deployed in the shared container, and a tenant container can have read access to the table via a view. If the tenant attempts to modify the materializable table, the table can be materialized in the tenant container. Metadata for a materializable table can include materialization instructions. Techniques and solutions are also provided for converting between sharing types, and for updating shared containers or table schemas.

Materializable database objects in multitenant environments

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

The present disclosure involves systems, software, and computer implemented methods for using declarative rules for optimized access to data. One example method includes receiving a structured query language (SQL) query, the SQL query associated with at least one database table and at least one predicate. A determination is made as to whether the SQL query is associated with at least one declarative rule based on the at least one database table and the at least one predicate. In response to determining that the SQL query is associated with at least one declarative rule, the at least one associated declarative rule is applied, during optimization of the SQL query. The at least one declarative rule defines a transformation to the SQL query to be performed during query optimization. An updated SQL query is generated based on the applied at least one associated declarative rule and the updated SQL query is provided.

Declarative rules for optimized access to data

A computer system including instructions recorded on a non-transitory computer-readable storage medium and readable by at least one processor may include a table generator module, a table updater module, and a data replicator module. The table generator module may be configured to cause the at least one processor to generate a target table. The table updater module may be configured to cause the at least one processor to modify data in the target table synchronously with data being modified in a source table. The data replicator module may be configured to cause the at least one processor to replicate the data contained in the source table in the target table.

Method for reorganizing or moving a database table

In an embodiment, a database interface performs a three-step optimistic database access. The database interface initially performs an optimistic read of a database object. The database object is checked for consistency after the optimistic read. If the database object is inconsistent, a first pessimistic read is performed with an isolation level that does not guarantee consistency (e.g., with an isolation level of committed read). The database object is checked again for consistency after the first pessimistic read. If the database object is inconsistent, a second pessimistic read is performed with an isolation level that may guarantee consistency (e.g., with an isolation level of repeatable read).

System and method for an optimistic database access

Methods and a system for managing database usage. The methods and system include receiving a request to create a table, determining the table is an empty table, and storing a pseudo-table in a data store in response to determining the table is empty. The pseudo-table may be a database view. Metadata related to a table may be stored in the pseudo-table to describe characteristics of the table. The pseudo-table occupies less space than a corresponding empty table. The system may implement the methods in middleware transparent to the applications.

Emulation of empty database tables using database views

In a software system () with a business application (), database migration from a source database () to a physically different target database () is performed by a migration tool () that evaluates database instructions () that the application () consecutively sends to the source database (). The migration tool () stores representations () of an action type (, D, I, U) and of a key () in a log table () when an action type coincides with a predetermined action type (D, I, U); copies source table entries to the target table (); and adjusts entries in the target table that have keys represented in the log table (). During migration, the application () and the source table continue communicating.

Growing community of inventors

Dielheim, Germany

Torsten Ziegler