Abstract: A database system receives a query and determines that the query includes an inner join between a parent table and a child table. The database system determines that the following relationships exists between the parent table and the child table: referential integrity (“RI”) between a primary key attribute (pk) in the parent table and a foreign key attribute (fk) in the child table and a temporal relationship constraint (“TRC”) between a period attribute in the parent table and a TRC-attribute in the child table. The database system determines that the query satisfies non-temporal join elimination conditions and temporal join elimination conditions and that the query contains no other qualification conditions on the parent table's period attribute and eliminates the inner join when planning execution of the query.

Abstract: A data store system may include at least one storage device to store a plurality of data and at least one processor with access to the storage device. The at least one processor may receive a plurality of features associated with an environment. The at least one processor may further generate a state representation of the environment based on the plurality of features. The at least one processor may further generate a plurality of predicted future states of the environment based on the state representation. The at least one processor may further generate at least one action to be performed by the environment based on the plurality of predicted future states. The at least one processor may provide the at least one action to the environment to be performed. A method and computer-readable medium are also disclosed.

Abstract: A method is provided for predicting workload group metrics of a workload management system of a database system. The method comprises predicting a future workload group metric for a plurality of workload groups based upon historical user-load patterns. Each workload group has a priority that is different from priority of other workload groups.

Abstract: A method for performing in-memory hash join processing. This method utilizes bulk processing within the hash join steps, such as performing bulk reads of hash values from tables to be joined, and performing bulk probes of hash values in tables to be joined, thereby providing more efficient utilization of memory bandwidth and CPU throughput, reducing memory accesses in the execution path, and reducing CPU cycles per instruction. Data movement is reduced by reducing load-stores to memory and by performing more operations in CPU cache.

Abstract: A method for performing in-memory hash join processing. This method utilizes bulk processing within the hash join steps, such as performing bulk reads of hash values from tables to be joined, and performing bulk probes of hash values in tables to be joined, thereby providing more efficient utilization of memory bandwidth and CPU throughput, reducing memory accesses in the execution path, and reducing CPU cycles per instruction.

Abstract: A query is received. It is determined that the query includes an inner join between a parent table and a child table. It is determined that the following relationships exist between the parent table and the child table: referential integrity (“RI”) between a primary key attribute (pk) in the parent table and a foreign key attribute (fk) in the child table, where “attribute” is defined to mean one or more columns; and a temporal relationship constraint (“TRC”) between a period attribute in the parent table and a TRC-attribute in the child table, the TRC-attribute being a date or time attribute. It is determined that the query does not access any attribute in the parent table other than the pk. It is determined that the query specifies an equality predicate of the form pk=fk. It is determined that the query specifies a condition that requires the TRC-attribute value to be contained in the parent table's period attribute duration.