Abstract: Computer-readable media, methods, and systems are disclosed for linear interval-based dynamic range partitioning in one or more database systems. A request is received by a database management system to insert a new row into a partitioned database table. The partitioned database table may include a plurality of existing partitions and a partition others partition. Based on determining that the new row should be inserted into the partition others partition a series of steps are performed. First, one or more new partitions are added to the partitioned database table. Then, the new row is inserted into the one of the one or more new partitions in the partitioned database table.

Abstract: A bottom cylinder for a high-temperature and high-pressure environment simulator of a high-fidelity corer is provided. The bottom cylinder includes a cylinder barrel. The bottom of the cylinder barrel is provided with a cylinder base. The piston is provided inside the cylinder barrel and divides an inner cavity of the cylinder barrel into a rodless cavity and a rod cavity. The piston is provided with a piston rod. The outer wall of the cylinder barrel is provided with an oil inlet hole communicated with the rodless cavity, an oil outlet hole communicated with the rod cavity, and a reserved hole. The lower end surface of the piston is provided with a first buffer ring, and the upper surface of the cylinder base is provided with a second buffer ring mated with the first buffer ring. The bottom cylinder is applied to the simulator for oil and gas resource exploitation.

Abstract: Computer-readable media, methods, and systems are disclosed for utilizing partition-based locking mechanisms to improve execution of overlapping data definition language (DDL) and data manipulation language (DML) operations on a partitioned database table. A first node receives a DML statement associated with a first transaction. The first node acquires a intent exclusive lock on table metadata. A second node receives a DDL statement associated with a second transaction and acquires an exclusive metadata lock on the partitioned table metadata. Next, an intent exclusive lock is acquired for the relevant partition table data on the second node and an exclusive lock on table metadata on the second node. The second transaction waits for the DML operation of the first transaction to complete. Then the first transaction is committed. Finally exclusive locks are acquired on table data and metadata and the second transaction is executed and committed.

Abstract: Computer-readable media, methods, and systems are disclosed for database table partition pruning based on statistical information associated with non-partition columns. A tree partition specification is received defining partitions for a plurality of computed column statistics. Respective partitions are created for the plurality of computed column statistics based on the tree partition specification. A request is received to compute statistics for a plurality of columns of the plurality of computed column statistics to result in a plurality of computed column statistics. In response to determining that one or more modifications have been made to the partitioned database, the plurality of computed column statistics is marked as invalid. The computed column statistics are refreshed in response to modifications of the partitioned table. Thereafter, the statistics are marked as valid. Unnecessary table partitions are pruned based on the statistics, and the associated query is executed.

Abstract: Computer-readable media, methods, and systems are disclosed for linear interval-based dynamic range partitioning in one or more database systems. A request is received by a database management system to insert a new row into a partitioned database table. The partitioned database table may include a plurality of existing partitions and a partition others partition. Based on determining that the new row should be inserted into the partition others partition a series of steps are performed. First, one or more new partitions are added to the partitioned database table. Then, the new row is inserted into the one of the one or more new partitions in the partitioned database table.

Abstract: Computer-readable media, methods, and systems are disclosed for database table partition pruning based on statistical information associated with non-partition columns. A tree partition specification is received defining partitions for a plurality of computed column statistics. Respective partitions are created for the plurality of computed column statistics based on the tree partition specification. A request is received to compute statistics for a plurality of columns of the plurality of computed column statistics to result in a plurality of computed column statistics. In response to determining that one or more modifications have been made to the partitioned database, the plurality of computed column statistics is marked as invalid. The computed column statistics are refreshed in response to modifications of the partitioned table. Thereafter, the statistics are marked as valid. Unnecessary table partitions are pruned based on the statistics, and the associated query is executed.

Abstract: Computer-readable media, methods, and systems are disclosed for utilizing partition-based locking mechanisms to improve execution of overlapping data definition language (DDL) and data manipulation language (DML) operations on a partitioned database table. A first node receives a DML statement associated with a first transaction. The first node acquires a intent exclusive lock on table metadata. A second node receives a DDL statement associated with a second transaction and acquires an exclusive metadata lock on the partitioned table metadata. Next, an intent exclusive lock is acquired for the relevant partition table data on the second node and an exclusive lock on table metadata on the second node. The second transaction waits for the DML operation of the first transaction to complete. Then the first transaction is committed. Finally exclusive locks are acquired on table data and metadata and the second transaction is executed and committed.

Abstract: A method may include generating a database table to include a first partition having a first range and a dynamic partition associated with an undefined range of a specified length. A record may be inserted into the database table. In response to one or more values of the record being outside of the first range of the first partition, a second partition having a second range of the specified length that includes the one or more values of the record may be generated. The record may be stored in the second partition. Moreover, a query on the database table may be executed by the first partition and/or the second partition of the database table. Related systems and articles of manufacture are also provided.

Abstract: A method may include generating a database table to include a first partition having a first range and a dynamic partition associated with an undefined range of a specified length. A record may be inserted into the database table. In response to one or more values of the record being outside of the first range of the first partition, a second partition having a second range of the specified length that includes the one or more values of the record may be generated. The record may be stored in the second partition. Moreover, a query on the database table may be executed by the first partition and/or the second partition of the database table. Related systems and articles of manufacture are also provided.

Abstract: A method for processing a query may include evaluating a query on a database table to identify a time based function included in the query. One or more partitions of the database table may be pruned from the query based at least on the partitions being associated with a first time range that does not overlap with a second time range associated with the time based function. An execution plan for the query may be generated to include a sequence of operations that avoids accessing the one or more partitions pruned from the query. The query may be executed based at least on the execution plan by at least accessing a second partition of the database table but not the first partition of the database table pruned from the query. Related systems and articles of manufacture are also provided.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing index and storage management for multi-tiered databases. An embodiment operates by receiving a request to create an index on a multi-tiered database including both an in-memory store and a disk store. A multi-store table associated with the index is determined, wherein the multi-store table includes both a first set of data stored on the memory store and a second set of data stored on the disk store. Either the first set of data or the second set of data on which to create the index is selected based on the request. The index for the selected set of data of the multi-store table is generated. The index is stored on either the disk store or the memory store as corresponding to the selected set of data for which the index was generated.

Abstract: Disclosed herein are system, method, and computer program product embodiments for providing index and storage management for multi-tiered databases. An embodiment operates by receiving a request to create an index on a multi-tiered database including both an in-memory store and a disk store. A multi-store table associated with the index is determined, wherein the multi-store table includes both a first set of data stored on the memory store and a second set of data stored on the disk store. Either the first set of data or the second set of data on which to create the index is selected based on the request. The index for the selected set of data of the multi-store table is generated. The index is stored on either the disk store or the memory store as corresponding to the selected set of data for which the index was generated.