Abstract: Aspects of the present invention disclose a method, computer program product, and system for prioritizing test cases for relational database systems. The method includes identifying one or more data tables within a relational database. The method further includes identifying an exclusivity value for each of the one or more identified data tables. The method further includes calculating a table weight for each of the one or more identified data tables. The method further includes prioritizing the one or more identified data tables based on the respective calculated table weights. The method further includes identifying one or more sequences of database statements corresponding to the prioritized data tables, wherein a database statement is a command executed on one of the prioritized data tables. The method further includes prioritizing the one or more identified sequences based on the corresponding database statements.

Abstract: As disclosed herein a computer system for secure database backup and recovery in a secure database network has N distributed data nodes. The computer system includes program instructions that include instructions to receive a database backup file, fragment the file using a fragment engine, and associate each fragment with one node, where the fragment is not stored on the associated node. The program instructions further include instructions to encrypt each fragment using a first encryption key, and store, randomly, encrypted fragments on the distributed data nodes. The program instructions further include instructions to retrieve the encrypted fragments, decrypt the encrypted fragments using the first encryption key, re-encrypt the decrypted fragments using a different encryption key, and store, randomly, the re-encrypted fragments on the distributed data nodes. A computer program product and method corresponding to the above computer system are also disclosed herein.

Abstract: One embodiment is a system for implementing context-aware access control of data in a relational database system. The system includes a memory having computer readable instructions and one or more processors for executing the computer readable instructions. According to the computer readable instructions, a request is received to access one or more tables of a database. Further according to the computer readable instructions, a context-aware access control, defined for at least a portion of the one or more tables, is identified. It is verified that the context-aware access control is satisfied. Access to the at least a portion of the one or more tables is permitted, responsive to verifying that the context-aware access control is satisfied.

Abstract: In some embodiments, a method includes detecting a structured query language (SQL) query. The method can also include determining that the SQL query includes a first sub-query and a second sub-query, wherein the first sub-query and second sub-query are operands for a Union operation, wherein a first result of the first sub-query is associated with a first Group By operation, wherein a second result of the second sub-query is associated with a second Group By operation, and wherein a result of the Union operation is associated with a third Group By operation. The method can also include determining that partitioning columns are the same for the first and second Group By operations; determining that the first and second sub-queries include identical algebraic functions; determining that the first Group By operation and first sub-query are not referenced elsewhere in the SQL query; and transforming the SQL query into an optimized query.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for pre-caching information in a database management system. Usage patterns of the database are analyzed to identify regularly recurring requests for information stored in the database. Based on the analyzed usage patterns, a pre-caching strategy is determined. The pre-caching strategy identifies information in the database that is likely to satisfy an anticipated future request. Prior to a time at which the future request is anticipated to be received, a cache in the database is populated with information that satisfies the anticipated future request in accordance with the determined pre-caching strategy. The information that populates the cache is retrieved from a storage medium that is slower to access than the cache.

Abstract: Some embodiments of the inventive subject matter include a method for transforming queries in a database management system. The can include detecting a first query, wherein the first query produces a first result upon evaluation by the database management system. The method can also include determining that the first query includes at least one operator, wherein the operator is selected from a union operator, an intersect operator, and an except operator, and wherein the operator has a first branch and second branch. The method can also include determining that the first branch of the operator accesses a first table, and wherein the second branch of the union operator also accesses the first table, and transforming the first query into a second query, wherein the second query does not include the operator, and wherein the second query produces the first result upon evaluation by the database management system.

Abstract: In some embodiments, a method includes detecting a structured query language (SQL) query. The method can also include determining that the SQL query includes a first sub-query and a second sub-query, wherein the first sub-query and second sub-query are operands for a Union operation, wherein a first result of the first sub-query is associated with a first Group By operation, wherein a second result of the second sub-query is associated with a second Group By operation, and wherein a result of the Union operation is associated with a third Group By operation. The method can also include determining that partitioning columns are the same for the first and second Group By operations; determining that the first and second sub-queries include identical algebraic functions; determining that the first Group By operation and first sub-query are not referenced elsewhere in the SQL query; and transforming the SQL query into an optimized query.