Abstract: An approach includes collecting metadata indicative of a computer system comprising (i) a primary database, configured to connect to a secondary database, and (ii) the secondary database that replicates the primary database. The approach further includes receiving, at the primary database from a requestor, a query referencing the primary database. The approach further includes, responsive to receiving the query, performing an offload including: determining a first load on the primary database; responsive to the first load satisfying a first offload condition, determining, using the metadata, whether a second load on the secondary database satisfies a second offload condition; and responsive to the second load satisfying the second offload condition, offloading at least part of the query to the secondary database in order to cause the at least part of the query to be executed by the secondary database. The method further includes providing to the requestor results of the query.

Abstract: A method, computer program product, and computer system for optimizing query processing is provided. An asynchronously updated index is provided for a main dataset. A time-sequences log of data modifications to the main dataset is provided. A query of the main dataset is received. The main dataset is joined with the time-sequenced log data resulting in a first intermediate result. The query is processed by keeping one or more entries satisfying the query by emulating a function of the asynchronously updated index resulting in a second intermediate result. Updated, deleted dataset entries are deleted from the asynchronously updated index. The query is processed resulting in a third intermediate result. A union of the second intermediate result and third intermediate result is built defining a final result.

Abstract: A method, computer program product, and computer system for optimizing query processing is provided. An asynchronously updated index is provided for a main dataset. A time-sequences log of data modifications to the main dataset is provided. A query of the main dataset is received. The main dataset is joined with the time-sequenced log data resulting in a first intermediate result. The query is processed by keeping one or more entries satisfying the query by emulating a function of the asynchronously updated index resulting in a second intermediate result. Updated, deleted dataset entries are deleted from the asynchronously updated index. The query is processed resulting in a third intermediate result. A union of the second intermediate result and third intermediate result is built defining a final result.

Abstract: A method, computer program product, and computer system for optimizing query processing is provided. An asynchronously updated index is provided for a main dataset. A time-sequences log of data modifications to the main dataset is provided. A query of the main dataset is received. The main dataset is joined with the time-sequenced log data resulting in a first intermediate result. The query is processed by keeping one or more entries satisfying the query by emulating a function of the asynchronously updated index resulting in a second intermediate result. Updated, deleted dataset entries are deleted from the asynchronously updated index. The query is processed resulting in a third intermediate result. A union of the second intermediate result and third intermediate result is built defining a final result.

Abstract: A method, computer program product, and computer system for optimizing query processing is provided. An asynchronously updated index is provided for a main dataset. A time-sequences log of data modifications to the main dataset is provided. A query of the main dataset is received. The main dataset is joined with the time-sequenced log data resulting in a first intermediate result. The query is processed by keeping one or more entries satisfying the query by emulating a function of the asynchronously updated index resulting in a second intermediate result. Updated, deleted dataset entries are deleted from the asynchronously updated index. The query is processed resulting in a third intermediate result. A union of the second intermediate result and third intermediate result is built defining a final result.

Abstract: Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table.

Abstract: Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table.

Abstract: Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table.

Abstract: Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table.

Abstract: Embodiments relate to table compression in a database. The database is organized in tables including rows and columns An aspect includes defining a range partition of a table of the database according to a first attribute of the table. Internal ranges of the table of the database are defined according to a second attribute of the table. A target internal range of the internal ranges is determined to insert a row as a new entry into the table. A determination is made as to whether an internal range compression directory exists for the target internal range. Based on determining that no internal range compression directory exists for the target internal range and a predefined threshold value of a number of rows is exceeded in the target internal range, the internal range compression directory for the target internal range is created.

Abstract: Embodiments relate to table compression in a database. The database is organized in tables including rows and columns An aspect includes defining a range partition of a table of the database according to a first attribute of the table. Internal ranges of the table of the database are defined according to a second attribute of the table. A target internal range of the internal ranges is determined to insert a row as a new entry into the table. A determination is made as to whether an internal range compression directory exists for the target internal range. Based on determining that no internal range compression directory exists for the target internal range and a predefined threshold value of a number of rows is exceeded in the target internal range, the internal range compression directory for the target internal range is created.

Abstract: Embodiments relate to table compression in a database. The database is organized in tables including rows and columns An aspect includes defining a range partition of a table of the database according to a first attribute of the table. Internal ranges of the table of the database are defined according to a second attribute of the table. A target internal range of the internal ranges is determined to insert a row as a new entry into the table. A determination is made as to whether an internal range compression directory exists for the target internal range. Based on determining that no internal range compression directory exists for the target internal range and a predefined threshold value of a number of rows is exceeded in the target internal range, the internal range compression directory for the target internal range is created.

Abstract: A method for compressing index pages in a database system is provided. The database system includes a table, and the table includes table columns. The method includes: providing an index associated with the table, wherein the index is stored on at least one index page of the database system, and wherein the index comprises index columns related to a part of the table columns; providing a first sequence of the index columns; providing a second sequence of the index columns; arranging the index columns stored on the at least one index page according to the second sequence; performing a prefix compression on entries of the at least one index page; and accessing the index using the first sequence of the index columns.

Abstract: A method for compressing index pages in a database system is provided. The database system includes a table, and the table includes table columns. The method includes: providing an index associated with the table, wherein the index is stored on at least one index page of the database system, and wherein the index comprises index columns related to a part of the table columns; providing a first sequence of the index columns; providing a second sequence of the index columns; arranging the index columns stored on the at least one index page according to the second sequence; performing a prefix compression on entries of the at least one index page; and accessing the index using the first sequence of the index columns.