Abstract: Methods for using SQL statements to access an application-server-managed database are disclosed herein. In some embodiments, a user sends, either directly or indirectly (i.e., remotely) a SQL statement from an ODBC application or server, respectively, to an application server that preprocesses SQL statements for accessing data from a centralized database. The application server may have a SQL endpoint, and access to the SQL endpoint may be determined by a user's logon credentials, a user's presentation of a SAML token, or a user's presentation of a valid certificate. The application server may then parse the SQL statement and determine the user's authorization to access certain objects in the centralized database based on a SQL handler design-time configuration. A result from the statement may be sent back to the user either directly or indirectly and exposed.

Abstract: Methods for using SQL statements to access an application-server-managed database are disclosed herein. In some embodiments, a user sends, either directly or indirectly (i.e., remotely) a SQL statement from an ODBC application or server, respectively, to an application server that preprocesses SQL statements for accessing data from a centralized database. The application server may have a SQL endpoint, and access to the SQL endpoint may be determined by a user's logon credentials, a user's presentation of a SAML token, or a user's presentation of a valid certificate. The application server may then parse the SQL statement and determine the user's authorization to access certain objects in the centralized database based on a SQL handler design-time configuration. A result from the statement may be sent back to the user either directly or indirectly and exposed.

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

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

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

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

Abstract: Provided are techniques for reclamation of empty pages in database tables. In response to receiving a plurality of records for insertion into a database table, the plurality of records are inserted into one or more contiguous pages. In response to at least some of the plurality of records being deleted from the database table, the one or more contiguous pages are reclaimed by: relocating any records from the plurality of records remaining in the one or more contiguous pages and releasing the one or more contiguous pages.

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

Abstract: Provided are techniques for reclamation of empty pages in database tables. In response to receiving a plurality of records for insertion into a database table, the plurality of records are inserted into one or more contiguous pages. In response to at least some of the plurality of records being deleted from the database table, the one or more contiguous pages are reclaimed by: relocating any records from the plurality of records remaining in the one or more contiguous pages and releasing the one or more contiguous pages.

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

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

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

Abstract: In a software system (200/210/220) with a business application (200), database migration from a source database (210) to a physically different target database (230) is performed by a migration tool (260) that evaluates database instructions (201) that the application (200) consecutively sends to the source database (210). The migration tool (260) stores representations (254, 255) of an action type (205, D, I, U) and of a key (231) in a log table (250) when an action type coincides with a predetermined action type (D, I, U); copies source table entries to the target table (240); and adjusts entries in the target table that have keys represented in the log table (250). During migration, the application (200) and the source table continue communicating.

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

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

Abstract: In a software system (200/210/220) with a business application (200), database migration from a source database (210) to a physically different target database (230) is performed by a migration tool (260) that evaluates database instructions (201) that the application (200) consecutively sends to the source database (210). The migration tool (260) stores representations (254, 255) of an action type (205, D, I, U) and of a key (231) in a log table (250) when an action type coincides with a predetermined action type (D, I, U); copies source table entries to the target table (240); and adjusts entries in the target table that have keys represented in the log table (250). During migration, the application (200) and the source table continue communicating.