International Business Machines Corporation

Dong Jie Wei

Brian K Caufield

Xin Yang

Yue Li

Zhao Li

Ke Wei Wei

Ling Xu

Miao Zheng

Mi Wan Shum

Samuel H K Wong

Fan Ding

Yong Li

Xiaoyan Pu

Eric Allen Jacobson

Lawrence A Greene

Shyam R Mudambi

Ron E Liu

Embodiments of the present invention disclose a method, computer program product, and system for generating and manipulating an index for a table in a database. A query statement is received, the table of lines are searched, a result list is generated, and an index for the query statement is generated, wherein the index comprises information associated with the result list and the query condition. The query condition and the identifier of the table is extracted from the query statement, where the index is generated based on the query condition, the identifier of the table, and the result list. A hash value of the identifier of the table and the query condition is obtained, an association between the hash value and the result list to build the index is generated, and in response to a line of the plurality of lines in the table being modified, the index identified as invalid.

Generating an index for a table in a database background

A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator.

Syntactical transformation of database interaction statements

A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator. A corresponding computer program product and computer system are also disclosed.

A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of &#x2514;m/n&#x2518; rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.

Data driven parallel sorting system and method

A method, computer program product, and system for dynamically distributing data for parallel processing in a computing system, comprising allocating a data buffer to each of a plurality of data partitions, where each data buffer stores data to be processed by its corresponding data partition, distributing data in multiple rounds to the data buffers for processing by the data partitions, where in each round the data is distributed based on a determined data processing capacity for each data partition, and where a greater amount of data is distributed to the data partitions with higher determined processing capacities, and periodically monitoring usage of each data buffer and re-determining the determined data processing capacity of each data partition based on its corresponding data buffer usage.

Dynamic data partitioning for optimal resource utilization in a parallel data processing system

Data flow disruptions over a series of data processing operators can be detected by a computer system that generates a profile for data flow at an operator. The profile can include data input, processing, and output wait times. Using the profile, the system can detect potential flow disruptions. If the potential disruption satisfies a rule, it is considered a data flow disruption and a recommendation associated with the satisfied rule is identified. The recommendation and the operator identity is displayed.

Growing community of inventors

Beijing, China

Dong Jie Wei