International Business Machines Corporation

Kiran Chinta

Naresh K Chainani

Liping Zhang

Ian R Finlay

Vijayshankar Raman

Ronald Jason Barber

Calisto Paul Zuzarte

Timothy Ray Malkemus

David C Kalmuk

Yuan Su

Christopher A Drexelius

A database containing filtering capabilities on VARCHAR columns for use with equality predicates and equi-join processing in column-organized tables. Every VARCHAR column within a database is associated with a hidden column in the same table that stores the respective string length.

Join and predicate filtering using string lengths for variable character fields

According to embodiments of the present invention, a metadata file is transferred from the first system to the second system and a database on the second system is initialized based on the metadata file. An image, including information of the first system to be restored, is transferred from the first system to the second system, and restoration of the information to the second system based on the image is initiated. Prior to completion of the restoration, one or more log files indicating actions performed on the first system relating to the information to be restored is transferred from the first system to the initialized database on the second system. In response to completion of the restoration, the actions of the log files are performed to synchronize the restored data on the second system with the first system.

Accelerated recovery after a data disaster

A computer-implemented method for a partitioned bloom filter merge is provided. A non-limiting example of the computer-implemented method includes partitioning, by a processing device, a bloom filter into N equal size filter partitions. The method further includes distributing, by the processing device, each of the filter partitions to an associated node. The method further includes merging, by the processing device, the filter partitions in each of the associated nodes. The method further includes redistributing, by the processing device, the merged filter partitions to each of the N nodes. The method further includes joining, by the processing device, the merged filter partitions in each of the N nodes to assemble a complete merged bloom filter.

Partitioned bloom filter merge for massively parallel processing clustered data management

A first query is detected. The first query is for a storage device, and pulls a result set from the storage device using a set of predicates. The first query satisfies a size criterion. A new set of predicates of the result set is identified. The new set of predicates does not include any predicates of the original set of predicates. A second query which is the same as the first query is detected. The new set of predicates is used to determine the result set.

Managing complex queries with predicates

According to one embodiment of the present invention, a method of transferring filters for operations in a distributed system comprises generating at each source node a first filter of a first size. The first filter indicates elements of objects that need not be processed for an operation. Each source node generates one more second filters of a second size less than the first size. Each generated second filter is based on a prior generated filter with each location representing a plurality of locations from the prior generated filter. A second filter is transferred from each source node to each of destination node. The elements of the objects to remove for the operation are determined based on the transferred second filters. Embodiments of the present invention further include a system and computer program product for transferring filters in a distributed system in substantially the same manners described above.

Efficient join-filters for parallel processing

A method for use in processing database queries performed on a database, having tables made up of outer table data and corresponding inner table data, distributed among storage associated with multiple nodes of a multi-threaded cluster of computers is described. The method involves, on each node, constructing a Bloom filter by writing a local portion of the complete Bloom filter and then receiving and merging Bloom filter components sent from each node using different startingOffset positions and then, once the Bloom filter is complete at a node, using the complete Bloom filter as a join filter in a table join operation, without regard to Bloom filter construction occurring at other nodes.

Bloom filter construction method for use in a table join operation portion of processing a query to a distributed database

A method for use in processing database queries performed on a database, having tables made up of outer table data and corresponding inner table data, distributed among storage associated with multiple nodes of a multi-threaded cluster of computers is described. The method involves constructing a Bloom filter at nodes by merging Bloom filter components on each node using different startingOffset positions for each thread and then, once the Bloom filter is complete at a node and using the complete Bloom filter as a join filter in a table join operation, without regard to Bloom filter construction occurring at others of the multiple nodes.

Growing community of inventors

Hillsboro, OR, United States of America

Kiran Chinta