Abstract: Processing a database table comprises receiving a multi-dimensional processing instruction for processing at least two columns of the database table, wherein the two columns comprise a selection column and a sort column, wherein the multi-dimensional processing instruction is for selecting a plurality of candidate rows by sorting based on the selection column and the sort column. An index takes the selection column as master column and the sort column as slave column. Nodes in the index are selected according to the selection column. Each of the selected nodes is associated with a respective slave column value sequence. A merge sort is performed on each of the slave column value sequences to obtain a sort result for the candidate rows.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and an RID results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: Using historical queries to determine database columns to populate a partial database. A partial database is created based, at least in part, on key values related to columns in a database for which the columns are most frequently accessed.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: The present invention discloses a mechanism for determining criticality of a SQL statement. A plurality of elements in the SQL statement is extracted. A score of the SQL statement is calculated based on a correlation relation among respective elements in the plurality of elements and base scores of the respective elements. The criticality of the SQL statement is determined based on the score of the SQL statement. In this way, a database administrator only needs to define a small number of rules according his own needs. In the meantime, the mechanism automatically analyzes a received simple or complex SQL statement according to the small number of rules defined by the user to determine its criticality, without missing any critical SQL statement, and thereby protect security of data in the database.

Abstract: Aspects include a method that includes receiving a structured query language (SQL) database command at a processing device configured to manage a table space of a relational database, the database command including a merge statement. The method also includes identifying a group of target records from the database command, and associating each target record with one of a plurality of portions of the table space, and in response to determining that the group of target records is associated with more than one portion of the table space, sorting the target records into a plurality of sub-groups, each sub-group associated with a different portion of the table space. The method further includes generating a sub-task associated with each sub-group, the sub-task prescribing aspects of performing the merge operation using an associated sub-group respective sub-group, and performing all of the sub-tasks on the memory space in parallel.

Abstract: A method, a computer program product, and a computer system for implementing multiple window based segment prefetch used for data pages that are out of sequence. A computer initiates a buffer for the segment prefetch. The computer builds up windows in the buffer, each of the windows comprising data pages among which neighboring data pages are within a predetermined distance therebetween. The computer determines whether a respective one of the windows exceeds a predetermined window size. The computer triggers the segment prefetch, in response to determining that the respective one of the windows exceeds the predetermined window size. The computer uses an asynchronous I/O to get the data pages in the respective one of the windows.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and an RID results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: Embodiments of the present disclosure include methods and systems of building an IP multimedia session without the use of a central server and switching IP multimedia session among devices. The method of building an IP multimedia session includes receiving a registering request from a plurality of IP multimedia session participant devices, electing a service device from the plurality of participant devices, and building IP multimedia session among the plurality of participant devices by using the elected service device.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.