Abstract: In an approach, a processor obtains a plurality of security policies for managing security of a database, the security policies defining respective sets of items to be monitored. A processor stores, respectively, the sets of items defined by the plurality of security policies in one or more item tables based on a predetermined criterion, the predetermined criterion comprising security policy relevance, security policy structure, and available space in the one or more item tables. A processor creates, for each of the one or more item tables, one or more respective index tables associated with the items in the respective item table. A processor creates, for each of the one or more item tables, a fast traverse block (FTB) associated with the created one or more respective index tables.

Abstract: Embodiments of the present invention relate to a method, system, and computer program product for multiplexing data operation. In some embodiments, a method is disclosed. A query for at least one table comprising a plurality of data records is received. The query indicating a plurality of data operations to be performed on the plurality of data records. The plurality of data operations are combined into a target data operation. An intermediate result of the query is generated by performing the target data operation on the plurality of data records. A final result of the query is determined based on the intermediate result. In other embodiments, a system and a computer program product are disclosed.

Abstract: A method, system, and computer program product for providing data security through database map restructuring are provided. The method identifies related data tables within a set of data tables within a database. The method identifies a set of related data types within the related data tables. A set of similarities is determined among the set of related data types. The related data types are mapped based on the set of similarities. Based on the mapping, method restructures one or more data tables of the set of data tables to generate a restructured data table.

Abstract: Systems and methods for pre-allocating and utilizing storage space in a relational database are provided. In embodiments a method includes: obtaining transaction data including data regarding record insertions in a relational database, wherein each record of the record insertions is associated with a key value; identifying a type of each of the record insertions as either a random insertion type or a key range insertion type based on the database transaction data, wherein the random insertion type comprises records associated with respective key values inserted in a random order, and the key range insert type comprises records associated with a range of key values inserted within a certain time period; predicting a new range of key values associated with future record insertions based on the type of each of the record insertions; and pre-allocating page space in one or more pages of the relational database for the future record insertions.

Abstract: Disclosed is a computer-implemented method to adjust partition keys. The method includes identifying a target table that is a target of a query, the target table including a set of initial partitions. The method also includes determining a set of common queries, wherein each of the common queries are configured to retrieve data from the target table. The method further includes identifying a plurality of core ranges. The method includes merging the core ranges into a new set of partitions. The method further includes setting, in response to the merging, updated partition keys. Further aspects of the present disclosure are directed to systems and computer program products containing functionality consistent with the method described above.

Abstract: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, performing subquery transformation on each subquery, which converts predicates of the subqueries to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query block(s) each having a list of predicates selected from the transformed query, processing each query block for column information, including column range information and column relationship information, and generating data and populating a dataset having table(s) and respective column(s) for each of the table(s). Generating the data uses the column range information and the column relationship information to select data for the dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

Abstract: A database query processor includes a database join prefetcher that prefetches N next join column values in order to execute the query more efficiently. The prefetched next join column values for an inner table are used to skip rows in an outer table, thereby increasing the performance of executing the query. The number N of prefetches can be dynamically determined and adjusted to improve the performance of executing the query.

Abstract: A DBMS receives a database-access request that includes an instruction to non-destructively read a database table row. The DBMS assigns the request a TSN identifier and creates a TSN image that identifies all TSNs assigned to transactions that are not yet committed. The DBMS traverses a linked list of log entries that identifies a chronological history of transactions performed on the same row. The DBMS infers that the table row currently contains data stored by the most recently logged transaction that is not contained in the TSN image and that has thus been committed. The DBMS then continues to process statements of the transaction based on the assumption that the row contains the inferred value. The DBMS performs this procedure without acquiring a shared lock on the data page or on the index leaf page that points to the table row.

Abstract: A computer-implemented method dynamically changes an access plan during run-time. The method includes, receiving, from a host, a query, that is configured to retrieve a set of data from a database. The method also includes, generating an access plan, the access plan comprising a plurality of commands. The method further includes, creating, for a first command of the plurality of commands, a plurality of mini plans including a first mini plan and a second mini plan. The method includes, analyzing each mini plan of the plurality of mini plans. The method also includes, changing, dynamically and in response to the analyzing, the access plan.

Abstract: A method, an apparatus, a system, and a computer program product for handling security threats in a network data processing system. A computer system determines a connection type for a connection in response to detecting the connection between a target resource in the network data processing system and a requestor. The computer system redirects the connection to a virtual resource in place of the target resource when the connection type is a threat connection, wherein the requestor originating the connection to the target resource is unable to perceive a redirection of the connection to the virtual resource. The computer system records information in the connection redirected to the virtual resource to form recorded information. The computer system adjusts a security policy for handling connections in the network data processing system using the recorded information, wherein the security threats in the network data processing system are decreased using the security policy.

Abstract: In an approach, a processor receives a first request to store a specific key to index pages of a database, wherein: the request indicates that the specific key is to be stored to a specific leaf page in a key-ordered chain of the index pages, and there is insufficient room in the specific leaf page to store the specific key. A processor determines at least one sibling leaf page of the specific leaf page in the key-ordered chain, the specific leaf page and the at least one sibling leaf page forming a first set. A processor determines that there is enough room in leaf pages of the first set to store existing keys in the leaf pages of the first set together with the specific key. A processor stores the existing keys in the leaf pages of the first set together with the specific key according to a redistribution policy.

Abstract: Functional verification of a new database feature is provided. A set of SQL query seeds are evolved using information contained in a knowledge map that was generated based on a real SQL query workload of an entity corresponding to a database. Real SQL queries are identified in the database that are similar to the evolved set of sample SQL query seeds. A new feature to be implemented in the database is injected into the real SQL queries that are similar to the evolved set of sample SQL query seeds. Multiple runtime access paths are generated for each of the real SQL queries injected with the new feature for output cross validation. Each of the real SQL queries injected with the new feature is run in a test environment using each of the multiple runtime access paths corresponding to a real SQL query injected with the new feature for functional verification.

Abstract: In an approach, a processor, responsive to requesting to perform a plurality of applications including a first application and a second application, determines that the first application and the second application have been performed sequentially during a previous time period. A processor, responsive to determining that the first and second applications have been performed in sequence during the previous time period, obtains, a first set of database operations associated with the first application and a second set of database operations associated with the second application. A processors, responsive to determining that the first set of database operations and the second set of database operations are free of conflict, generates an execution schedule indicating that the first application and the second application are to be performed in parallel. A processors performs the plurality of applications based on the execution schedule.

Abstract: In an approach, a processor receives a first request to store a specific key to index pages of a database, wherein: the request indicates that the specific key is to be stored to a specific leaf page in a key-ordered chain of the index pages, and there is insufficient room in the specific leaf page to store the specific key. A processor determines at least one sibling leaf page of the specific leaf page in the key-ordered chain, the specific leaf page and the at least one sibling leaf page forming a first set. A processor determines that there is enough room in leaf pages of the first set to store existing keys in the leaf pages of the first set together with the specific key. A processor stores the existing keys in the leaf pages of the first set together with the specific key according to a redistribution policy.

Abstract: A system optimizes performance of parallel queries by dividing a query into a plurality of sub queries. The query is divided according to a plurality of data ranges associated with the query. The system creates an available queue, and a defer queue. The system assigns the plurality of sub queries into the available queue. The system then processes, in parallel, the plurality of sub queries in the available queue. During the processing, if the system determines that a data range associated with a sub query comprises unavailable data, the system assigns the sub query to the defer queue as a defer range sub query. After completing the processing of the plurality of sub queries in the available queue, the system processes a plurality of defer range sub queries in the defer queue.

Abstract: Provided are a computer program product, system, and method for generating sub-indexes from an index to compress the index. An index has levels of nodes for a composite key comprised of component keys. Each node includes at least one composite key value comprised of component key values. A plurality of sub-indexes is generated including one sub-index for each component key of the composite key. Nodes are generated in each sub-index corresponding to nodes in the index. In each node of the nodes of the sub-index, a component key value is generated, for the component key for which the sub-index was generated, from at least one composite key value in the corresponding node of the index. The sub-indexes are used to search for a record matching a search composite key value in the database using component key values of the search composite key value.

Abstract: A method, an apparatus, a system, and a computer program product for handling security threats in a network data processing system. A computer system determines a connection type for a connection in response to detecting the connection between a target resource in the network data processing system and a requestor. The computer system redirects the connection to a virtual resource in place of the target resource when the connection type is a threat connection, wherein the requestor originating the connection to the target resource is unable to perceive a redirection of the connection to the virtual resource. The computer system records information in the connection redirected to the virtual resource to form recorded information. The computer system adjusts a security policy for handling connections in the network data processing system using the recorded information, wherein the security threats in the network data processing system are decreased using the security policy.

Abstract: Provided are a computer program product, system, and method for generating sub-indexes from an index to compress the index. An index has levels of nodes for a composite key comprised of component keys. Each node includes at least one composite key value comprised of component key values. A plurality of sub-indexes is generated including one sub-index for each component key of the composite key. Nodes are generated in each sub-index corresponding to nodes in the index. In each node of the nodes of the sub-index, a component key value is generated, for the component key for which the sub-index was generated, from at least one composite key value in the corresponding node of the index. The sub-indexes are used to search for a record matching a search composite key value in the database using component key values of the search composite key value.

Abstract: A system optimizes performance of parallel queries by dividing a query into a plurality of sub queries. The query is divided according to a plurality of data ranges associated with the query. The system creates an available queue, and a defer queue. The system assigns the plurality of sub queries into the available queue. The system then processes, in parallel, the plurality of sub queries in the available queue. During the processing, if the system determines that a data range associated with a sub query comprises unavailable data, the system assigns the sub query to the defer queue as a defer range sub query. After completing the processing of the plurality of sub queries in the available queue, the system processes a plurality of defer range sub queries in the defer queue.

Abstract: An expansion card securing mechanism is configured to secure different kinds of expansion cards. The expansion card securing mechanism includes a base and a plurality of securing members which are secured on the base. The base includes a latch portion. The latch portion defines a plurality of latch holes, the securing member can be secured in the latch hole. Each securing member defines a cavity, the latch hole and the cavity can receive different kinds of expansion cards to secure the expansion cards.