Abstract: 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.

Abstract: A method includes joining data between at least two data sets. Values of one or more join attributes of each of the data sets is represented in a compressed form, indicated by an encoding scheme. A compression scheme for the one or more join attributes is dynamically selected.

Abstract: This disclosure describes, in one embodiment, a system that includes a block storage and virtual machine (VM) manager to identify one or more storage node(s) that meet at least one policy constraint and to select a storage node with capacity from the one or more storage node(s) that meets all of the at least one policy constraints, the at least one policy constraint related to a respective geolocation of each of the identified storage node(s).

Abstract: 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.

Abstract: 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.

Abstract: Performing a join of first and second database tables for a query includes applying a predicate of the query to the first table as a first predicate and determining how many distinct join key values the first table has that survive the applying of the first predicate, wherein a join key value of the first table that survives the applying of the first predicate is a surviving join key value for a second predicate. A selection includes selecting among applying the second predicate to the second table, probing the second table with the second predicate, and neither applying the second predicate to the second table nor probing the second table with the second predicate, wherein the selecting is responsive to the number of distinct, surviving join key values.

Abstract: Performing a join of first and second database tables for a query includes applying a predicate of the query to the first table as a first predicate and determining how many distinct join key values the first table has that survive the applying of the first predicate, wherein a join key value of the first table that survives the applying of the first predicate is a surviving join key value for a second predicate. A selection includes selecting among applying the second predicate to the second table, probing the second table with the second predicate, and neither applying the second predicate to the second table nor probing the second table with the second predicate, wherein the selecting is responsive to the number of distinct, surviving join key values.

Abstract: 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.

Abstract: Technologies for adjusting server power consumption include a computing device to receive resource utilization data from a plurality of servers. The computing device identifies a source server and a destination server of the plurality of servers based on the resource utilization data and calculates the difference in resource utilization between the identified source server and the identified destination server based on the resource utilization data. If the computing device determines that the difference exceeds a threshold value, the computing device increases processor utilization of a processor of the source server by a power consumption change amount and decreases processor utilization of a processor of the destination server by a corresponding power consumption change amount to balance the servers' resources and create more head-room to place new workloads on the servers.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments include method, system, and computer program product for providing aggregation hierarchy that is related memory hierarchies. In one embodiment, the method includes determining capacity of a first level memory of a memory hierarchy for processing data relating to completion of an aggregation process and generating a per thread local look-up table in said first level memory upon determining said capacity. Upon the first level memory reaching capacity, a plurality of per thread partitions to store remaining data to complete the aggregation process in a second level memory of the memory hierarchy is generated such that each of said per-thread partitions includes an identical amount of data portion on each thread. The method also includes storing the per thread partitions in said second level memory and providing a single global look up table for each of the identical data portions.

Abstract: Embodiments of the invention relate to processing queries that utilize fact and/or dimension tables. In one aspect, a pre-join filtering phase precedes a star join. The necessary conditions for the pre-join filtering are considered for a given SQL query, including an estimated size of the hash table exceeding a threshold and presence of a local predicate either on the fact table or one or more dimension tables that is not a large dimension table. Once the necessary conditions are satisfied, the execution of the query exploits the pre-join filtering to build a pre-join output filter from columns of a reduced fact table that joins with each large dimension table. Thereafter, all the dimension tables and the fact table are joined in a star join while exploiting each pre-join filter.

Abstract: According to one embodiment of the present invention, a system with a plurality of memories, generates a first filter associated with a first memory, and generates one or more second filters each associated with a corresponding memory. Each second filter is generated with a size at least partially accommodated within the storage capacity of the associated memory. The system determines absence of items from a set by selectively probing the generated filters in an ascending order of data access speed to the associated memories and aborts further probing for an item in response to a probe indicating that the item is absent from the set. Embodiments of the present invention further include a method and computer program product for testing set membership in substantially the same manners described above.

Abstract: According to one embodiment of the present invention, a system with a plurality of memories, generates a first filter associated with a first memory, and generates one or more second filters each associated with a corresponding memory. Each second filter is generated with a size at least partially accommodated within the storage capacity of the associated memory. The system determines absence of items from a set by selectively probing the generated filters in an ascending order of data access speed to the associated memories and aborts further probing for an item in response to a probe indicating that the item is absent from the set. Embodiments of the present invention further include a method and computer program product for testing set membership in substantially the same manners described above.

Abstract: A parasitic power supply derives power from its proximity to an electrical power conductor. The power supply includes a transformer having a coil disposed on a core structured to be disposed parallel to the power conductor. The coil has a voltage induced by current flowing in the power conductor. A voltage regulating circuit cooperates with the transformer and includes a capacitor having a voltage, a charge switch structured to charge the capacitor from the coil voltage, a bootstrap circuit structured to enable the charge switch to charge the capacitor when the capacitor voltage is below a first predetermined value, a charge controller structured to enable the charge switch to charge the capacitor when the capacitor voltage is below a second predetermined value, and a voltage regulator powered by the capacitor voltage.

Abstract: Embodiments include method, system, and computer program product for providing aggregation hierarchy that is related memory hierarchies. In one embodiment, the method includes determining capacity of a first level memory of a memory hierarchy for processing data relating to completion of an aggregation process and generating a per thread local look-up table in said first level memory upon determining said capacity. Upon the first level memory reaching capacity, a plurality of per thread partitions to store remaining data to complete the aggregation process in a second level memory of the memory hierarchy is generated such that each of said per-thread partitions includes an identical amount of data portion on each thread. The method also includes storing the per thread partitions in said second level memory and providing a single global look up table for each of the identical data portions.

Abstract: A system for tunable removal rates and selectivity of materials during chemical-mechanical polishing using a chemical slurry or solution with increased dissolved oxygen content. The slurry can optionally include additives to improve removal rate and/or selectivity. Further selectivity can be obtained by varying the concentration and type of abrasives in the slurry, using lower operating pressure, using different pads, or using other additives in the dispersion at specific pH values.

Abstract: Embodiments of the invention relate to processing queries that utilize fact and/or dimension tables. In one aspect, a pre-join filtering phase precedes a star join. The necessary conditions for the pre-join filtering are considered for a given SQL query, including an estimated size of the hash table exceeding a threshold and presence of a local predicate either on the fact table or one or more dimension tables that is not a large dimension table. Once the necessary conditions are satisfied, the execution of the query exploits the pre-join filtering to build a pre-join output filter from columns of a reduced fact table that joins with each large dimension table. Thereafter, all the dimension tables and the fact table are joined in a star join while exploiting each pre-join filter. Accordingly, the order of when joins occur is changed in order to reduce the size of the fact table and to work from the fact table to reduce the size of large dimension tables.

Abstract: A method and system for tunable removal rates and selectivity of materials during chemical-mechanical polishing using a chemical slurry or solution with increased dissolved oxygen content. The slurry can optionally include additives to improve removal rate and/or selectivity. Further selectivity can be obtained by varying the concentration and type of abrasives in the slurry, using lower operating pressure, using different pads, or using other additives in the dispersion at specific pH values.