Abstract: A technique relates to determining a presence of a known nucleic acid sequence of a known molecule in a sample. A sample surface is coated with a select segment of the known molecule. Beads are coated with a first molecule. A targeted nucleic acid sequence is attached to a second molecule that binds to the first molecule, such that the targeted nucleic acid sequence is attached to the beads via first and second molecules. The sample is placed on the sample surface. The sample includes the liquid medium, beads, and targeted nucleic acid sequence being tested. Brownian motion of beads is monitored to determine whether the Brownian motion of the beads is restricted or not restricted. When the Brownian motion of beads is restricted, the presence of the known nucleic acid sequence is in the sample, thus indicating that the targeted nucleic acid sequence is the known nucleic acid sequence.

Abstract: A system, method, and computer readable storage medium for accessing a data file shared by all computing nodes participating in a system based on a blockchain protocol. The data file includes transactions and blocks. The transactions are data to be stored in the blockchain and the blocks are records that confirm when and in what sequence certain transaction became journaled as part of the blockchain. A request is received to include a plurality of transactions each with additional data as a new block on the blockchain. Criteria that includes a settable period of time or a settable number of transactions received is used to determine how many transactions go into a new block. A directed acyclic graph (DAG) is accessed that is constructed based on inter-dependencies among the transactions. The transactions for the new block are divided into a set of two or more independent tasks that can be executed in parallel based on the DAG. The independent tasks that can be managed independently are executed.

Abstract: An integrated data processing system with two-tier data caching system and techniques for use thereof in a hybrid RDBMS and BDS computing environment are provided. In one aspect, the system is RDBMS-centric and uses two caches, one on the RDBMS side (1st tier) and the other on the BDS side (2nd tier). In another aspect, a DRDA wrapper on the BDS side enables the RDBMS to communicate with the BDS as if the BDS is another RDBMS. This is advantageous because the RDBMS already supports the DRDA protocol standard. In yet another aspect, the DRDA wrapper performs the data transformation needed when transferring cached objects between the RDBMS cache and BDS cache because RDBMS and BDS save data objects in different formats. This is advantageous because it offloads the computation from RDBMS to BDS therefore reducing the performance impact on RDBMS for its normal query and transaction processing.

Abstract: A technique relates to determining a presence of a known nucleic acid sequence of a known molecule in a sample. A sample surface is coated with a select segment of the known molecule. Beads are coated with a first molecule. A targeted nucleic acid sequence is attached to a second molecule that binds to the first molecule, such that the targeted nucleic acid sequence is attached to the beads via first and second molecules. The sample is placed on the sample surface. The sample includes the liquid medium, beads, and targeted nucleic acid sequence being tested. Brownian motion of beads is monitored to determine whether the Brownian motion of the beads is restricted or not restricted. When the Brownian motion of beads is restricted, the presence of the known nucleic acid sequence is in the sample, thus indicating that the targeted nucleic acid sequence is the known nucleic acid sequence.

Abstract: A system for transferring data from a Relational Database Management System (“RDBMS”) to a big data platform and methods for making and using the same. The system can acquire a partitioning execution scheme of a selected table from the RDBMS and submitting partitioned queries from the big data platform to each mapper of partitions. The partitioned queries are generated based on the partitioning execution scheme. The partitioning execution scheme can be acquired by submitting a query explain request to an optimizer of the RDBMS to generating a parallel query plan. The partitioning execution scheme can also be acquired by querying statistics from a statistics catalog of the RDBMS or by user inputs. The system can use RDBMS capabilities and statistics for parallel data fetching. Thereby, the system can increase efficiency of the fetching and can avoid straggling when target data is not evenly distributed and can avoid table query-in-serial.

Abstract: A technique relates to determining a presence of a known nucleic acid sequence of a known molecule in a sample. A sample surface is coated with a select segment of the known molecule. Beads are coated with a first molecule. A targeted nucleic acid sequence is attached to a second molecule that binds to the first molecule, such that the targeted nucleic acid sequence is attached to the beads via first and second molecules. The sample is placed on the sample surface. The sample includes the liquid medium, beads, and targeted nucleic acid sequence being tested. Brownian motion of beads is monitored to determine whether the Brownian motion of the beads is restricted or not restricted. When the Brownian motion of beads is restricted, the presence of the known nucleic acid sequence is in the sample, thus indicating that the targeted nucleic acid sequence is the known nucleic acid sequence.

Abstract: A technique relates to determining a presence of a known nucleic acid sequence of a known molecule in a sample. A sample surface is coated with a select segment of the known molecule. Beads are coated with a first molecule. A targeted nucleic acid sequence is attached to a second molecule that binds to the first molecule, such that the targeted nucleic acid sequence is attached to the beads via first and second molecules. The sample is placed on the sample surface. The sample includes the liquid medium, beads, and targeted nucleic acid sequence being tested. Brownian motion of beads is monitored to determine whether the Brownian motion of the beads is restricted or not restricted. When the Brownian motion of beads is restricted, the presence of the known nucleic acid sequence is in the sample, thus indicating that the targeted nucleic acid sequence is the known nucleic acid sequence.

Abstract: Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling compound requests, in a system comprising multiple nodes for executing requests in which an individual request is associated with a particular node, comprises the following steps. A compound request comprising at least two individual requests associated with a same node is received. It is determined if both of the at least two individual requests are executable. The compound request is executed if it is determined that all individual requests of the compound request can execute.

Abstract: Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling requests in a data processing system comprises the following steps. A compound request comprising at least two individual requests of different types is received. An individual request r1 of the compound request is placed on a queue for requests of type t1, wherein t1 is the request type of r1. After r1 has reached the front of the queue, it is determined if at least one individual request of said compound request can execute. The compound request is executed if it is determined that all individual requests of the compound request can execute.

Abstract: Techniques are provided for hardware-accelerated relational joins. A first table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the first table is hashed to set at least one bit in at least one bit vector. A second table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the second table is hashed to generate at least one hash value. At least one bit vector is probed using the at least one hash value. A joined row is constructed responsive to the probing step. The row-construction step is performed in the hardware accelerator.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Techniques for maintaining high availability servers are disclosed. For example, a method comprises the following steps. One or more client requests are provided to a first server for execution therein. The one or more client requests are also provided to a second server for storage therein. In response to the first server failing, the second server is configured to execute at least one client request of the one or more client requests provided to the first server and the second server that is not properly executed by the first server.

Abstract: Embodiments of the invention broadly contemplate systems, methods and arrangements for processing multi-leg transactions. Embodiments of the invention process multi-leg transactions while allowing later arrived orders to get processed during the time when an earlier, tradable multi-leg transaction is pending using a look-ahead mechanism without violating any relevant timing or exchange rules.

Abstract: Techniques are provided for hardware-accelerated relational joins. A first table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the first table is hashed to set at least one bit in at least one bit vector. A second table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the second table is hashed to generate at least one hash value. At least one bit vector is probed using the at least one hash value. A joined row is constructed responsive to the probing step. The row-construction step is performed in the hardware accelerator.

Abstract: Systems, methods, and products for database system transaction management are provided herein. One aspect provides for annotating via a computing device at least one data object residing on the computing device utilizing at least one transaction tag, the at least one transaction tag being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. Other embodiments and aspects are also described herein.

Abstract: A method for determining status of system resources in a computer system includes loading a first operating system into a first memory, wherein the first operating system discovers system resources and reserves a number of the system resources for use of an augmenting operating system, loading the augmenting operating system into a second memory reserved for the augmenting operating system by the first operating system, accessing the first memory from the augmenting operating system and obtaining data, running a process on the augmenting operating system to perform a computation using the data obtained from the first memory, and outputting the results of the computation using the system resources reserved for the augmenting operating system.

Abstract: A system for distributing a plurality of tasks over a plurality of nodes in a network includes: a plurality of processors for executing tasks; a plurality of nodes comprising processors; a task dispatcher; and a load balancer. The task dispatcher receives as input the plurality of tasks; calculates a task processor consumption value for the tasks; calculates a node processor consumption value for the nodes; calculates a target node processor consumption value for the nodes; and then calculates a load index value as a difference between the calculated node processor consumption for a node i and the target node processor consumption value for the node i. The balancer distributes the tasks among the nodes to balance the processor workload among the nodes according to the calculated load index value of each node, such that the calculated load index value of each node is substantially zero.

Abstract: A computer-implemented method for distributing a plurality of tasks over a plurality of processing nodes in a processor network includes the following steps: calculating a task process consumption value for the tasks; calculating a measured node processor consumption value for the nodes; calculating a target node processor consumption value for the nodes, the target node processor consumption value indicating optimal node processor consumption; calculating a load index value as a difference between the calculated node processor consumption value for a node i and the target node processor consumption value for node i; and distributing the tasks among the nodes to balance a processor workload among the nodes, according to the calculated load index value, such that the calculated load index value of each node is substantially zero.