Abstract: According to one embodiment of the present invention, at least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above.

Abstract: At least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above.

Abstract: According to one embodiment of the present invention, at least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above.

Abstract: A method for generating occurrence data of data values for enabling encoding of a data set includes determining occurrences of data values in a first data batch and determining occurrence count information for a first number of most frequent data values in the first data batch, the occurrence count information identifying the most frequent data values and their occurrence counts. The method also includes generating for rest of the data values in the first data batch at least a first histogram having a second number of buckets and merging the occurrence count information of the first data batch with occurrence count information of a second data batch. The method further includes merging the first histogram of the first data batch to a merged histogram corresponding to the second data batch and processing a next data batch as a first data batch until the data set to be encoded is processed.

Abstract: A mechanism is provided for reorganizing a source index tree of a database table resulting in a target index tree of the database table is provided. A backup process reads source leaf pages of the source index tree in a logical order defined by a sequence of index keys. The logical order can be different from a physical order of the source leaf pages defined by a sequence of respective storage locations. The backup process constructs target leaf pages of the target index tree maintaining the logical order. A restore process constructs target non-leaf pages of the target index tree based on the distribution of the index keys among the constructed leaf pages and stores the target leaf and non-leaf pages.

Abstract: Methods for processing a query in a multi-tenancy environment utilizing an electronic computing device are presented, the methods including: causing the electronic computing device to receive the query to a database, where the query includes a number of objects; causing the electronic computing device to determine whether any of the number of objects correspond with the set of tenant database objects; if any of the number of objects correspond with the set of tenant database objects, causing the electronic computing device to process the number of objects from the tenant production table; and if any of the number of objects correspond with the set of instance database objects, causing the electronic computing device to process the number of objects from the instance production table.

Abstract: Database systems are presented including: a database; a database instance of the database, where the database instance includes a set of instance database objects, and where the database instance is accessible by an instance user; and a database tenant associated with the database instance, where the database tenant includes a set of tenant database objects, where the database tenant provides access to the database instance by the tenant user, such that the instance user and the tenant user may independently access the database instance without affecting one another where each of the instance user and the tenant user are configured with independent accessibility. In some embodiments, systems further include: an instance production table associated with the database instance and a tenant production table associated with the database instance.

Abstract: A cell-specific dictionary is applied adaptively to adequate cells, where the cell-specific dictionary subsequently optimizes the handling of frequency-partitioned multi-dimensional data. This includes improved data partitioning with super cells or adjusting resulting cells by sub-dividing very large cells and merging multiple small cells, both of which avoid the highly skewed data distribution in cells and improve the query processing. In addition, more efficient encoding is taught within a cell in case the distinct values that actually appear in that cell are much smaller than the size of the column dictionary.

Abstract: A method for generating occurrence data of data values for enabling encoding of a data set includes determining occurrences of data values in a first data batch and determining occurrence count information for a first number of most frequent data values in the first data batch, the occurrence count information identifying the most frequent data values and their occurrence counts. The method also includes generating for rest of the data values in the first data batch at least a first histogram having a second number of buckets and merging the occurrence count information of the first data batch with occurrence count information of a second data batch. The method further includes merging the first histogram of the first data batch to a merged histogram corresponding to the second data batch and processing a next data batch as a first data batch until the data set to be encoded is processed.

Abstract: A method and apparatus for transparent analytical query acceleration identifies within a database management system (DBMS) if a query is an analytical type. The query is processed with an analytical query processor if the query is the analytical type. In addition, the query is processed within the DBMS if the query is not the analytical type.

Abstract: According to an embodiment of the present invention, a method for reorganizing a source index tree of a database table resulting in a target index tree of the database table is provided. A backup process reads source leaf pages of the source index tree in a logical order defined by a sequence of index keys. The logical order can be different from a physical order of the source leaf pages defined by a sequence of respective storage locations. The backup process constructs target leaf pages of the target index tree maintaining the logical order. A restore process constructs target non-leaf pages of the target index tree based on the distribution of the index keys among the constructed leaf pages and stores the target leaf and non-leaf pages.

Abstract: According to an embodiment of the present invention, a method for reorganizing a source index tree of a database table resulting in a target index tree of the database table is provided. A backup process reads source leaf pages of the source index tree in a logical order defined by a sequence of index keys. The logical order can be different from a physical order of the source leaf pages defined by a sequence of respective storage locations. The backup process constructs target leaf pages of the target index tree maintaining the logical order. A restore process constructs target non-leaf pages of the target index tree based on the distribution of the index keys among the constructed leaf pages and stores the target leaf and non-leaf pages.

Abstract: A method for tuning a database system is disclosed. A tuning strategy is received comprising a first procedure to determine a suggested tuning action, and a second procedure to measure performance of the database system. The suggested tuning action is determined and pre-action performance measured according to the respective procedures. Undo information that indicates how to undo the database system state change of the suggested tuning action is recorded in a database system state history. After executing the suggested tuning action, post-action database system performance is measured according to the second procedure. When the post-action performance is lower than the pre-action performance, the database system state change is undone using the undo information. Embodiments enabling to create new tuning strategies, downloading existing tuning strategies, sharing own tuning strategies and changing existing tuning strategies are disclosed as well.

Abstract: A cell-specific dictionary is applied adaptively to adequate cells, where the cell-specific dictionary subsequently optimizes the handling of frequency-partitioned multi-dimensional data. This includes improved data partitioning with super cells or adjusting resulting cells by sub-dividing very large cells and merging multiple small cells, both of which avoid the highly skewed data distribution in cells and improve the query processing. In addition, more efficient encoding is taught within a cell in case the distinct values that actually appear in that cell are much smaller than the size of the column dictionary.

Abstract: According to one embodiment of the present invention, a method for identifying relevant database indexes is provided. According to one embodiment of the present invention, a method includes determining the importance of a particular database transaction and storing an index name related to the transaction along with an indicator of the importance. A database transaction is initiated and the importance indicator is received in an index advisor. The index advisor then makes an index recommendation based on the index importance.

Abstract: Methods and apparatus, including computer program products, for maintaining a set of indexes in a database management system (DBMS) having at least one table. A current, stale or deferred status is defined for at least a part of the indexes, resulting in at least a part of a set of current, stale, or deferred indexes in the DBMS. Current indexes are maintained by refreshing a current index synchronously with a table change relating to the current index. Stale indexes are maintained by refreshing a stale index continuously and asynchronously to table modifications of tables relating to the stale index based on log information relating to the modifications. Deferred indexes are maintained by building a deferred index in response to a query to a table relating to the deferred index, thereby bringing the deferred index in accordance with the current query time status to the table relating to the deferred index.

Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.

Abstract: Database systems are presented including: a database; a database instance of the database, where the database instance includes a set of instance database objects, and where the database instance is accessible by an instance user; and a database tenant associated with the database instance, where the database tenant includes a set of tenant database objects, where the database tenant provides access to the database instance by the tenant user, such that the instance user and the tenant user may independently access the database instance without affecting one another where each of the instance user and the tenant user are configured with independent accessibility. In some embodiments, systems further include: an instance production table associated with the database instance and a tenant production table associated with the database instance.

Abstract: A method and system for preventing redundant indexes in a database management system (DBMS). A received create-index command specifies a new index to be created for retrieving data from a table created by the DBMS and a redundancy check to be performed for the new index in conjunction with an action parameter in the create-index command. If the action parameter includes a REPORT value, each redundant index is stored and/or displayed and the new index is created. If the action parameter includes a PREVENT value and an existing index is redundant in view of the new index and the new index is not redundant in view of the existing index, the existing index is deleted and the new index is created. If the action parameter includes a PREVENT value and the new index is redundant in view of an existing index, the new index is not created.

Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.