Abstract: The disclosed systems, structures, and methods are directed towards for processing a lock request by a master node to access a shared data object in a database located at a remote location comprising identifying, in the master node, a category of the lock request. If the lock request is for a self-compatible lock, determining a value of a counter associated with the master node and with one or more other master nodes, and if the value of the counter is zero, locally granting the lock request. If the value of the counter is greater than zero, forwarding the lock request to a global lock manager (GLM), and if the lock request is for a heavy-conflicting lock, forwarding the lock request by the master node to the GLM.

Abstract: The disclosed computing node comprises a processor and a non-transitory storage medium storing instructions executable by the processor. A method and a system are also disclosed. A subset of a plurality of conventional redo records, corresponding to received write requests, is selected based on an identical data location identifier. The conventional redo records of such selected subset are combined into a consolidated redo record. The consolidated redo record is then transmitted to a target node for processing.

Abstract: Embodiments described herein provide a solution for optimizing a generating of query search results. A filtering search term (e.g., a search term that is used in a query to perform filtering aggregations of the query search results) is identified. A filtering bitmap that has a plurality of mapped locations corresponding to data values for the filtering search term is created. As a data value in the filtering search term is encountered during a scan of the query search results, the corresponding mapped location is updated. Each mapped location in the filtering bitmap is read to determine whether the value corresponding to the mapped location satisfies the filtering aggregation. The filtering aggregation can then be performed (e.g., prior to any grouping aggregation) by removing any of the query search results determined, based on the filtering bitmap, as having data values for which the filtering aggregation is not satisfied.

Abstract: This application provides a data processing method and apparatus. The method includes: receiving, by a master storage node, information that is about a first transaction and that is sent by a read-write node, where the information about the first transaction is used to request to perform a write operation on first data stored on the master storage node; determining, by the master storage node, the first data based on the information about the first transaction, and executing the first transaction; generating, by the master storage node, first transaction status metadata when the first transaction ends, where the first transaction status metadata includes identification information of expired data and identification information of the first transaction; and sending, by the master storage node, the first transaction status metadata to at least one read-only node. According to the data processing method and apparatus, a read delay of a read-only node can be eliminated.

Abstract: Provided herein are techniques for processing a database query aggregating data. Data tuples of a database object each including a grouping element and a data element are analyzed to determine a length of the data element for each data tuple. A plurality of tables each accommodate a successively greater length for the data element. A corresponding table of the plurality of tables to store each data tuple is determined based on the length of the data element of that data tuple relative to the accommodated lengths of the plurality of tables. Each data tuple in the determined corresponding table is stored to group the data tuples within each of the plurality of tables based on the grouping element, and an indication of corresponding tables containing members for each group is provided. The groups are combined across the plurality of tables to aggregate the data tuples for a database query.

Abstract: Embodiments described herein provide a solution for optimizing a generating of query search results. A filtering search term (e.g., a search term that is used in a query to perform filtering aggregations of the query search results) is identified. A filtering bitmap that has a plurality of mapped locations corresponding to data values for the filtering search term is created. As a data value in the filtering search term is encountered during a scan of the query search results, the corresponding mapped location is updated. Each mapped location in the filtering bitmap is read to determine whether the value corresponding to the mapped location satisfies the filtering aggregation. The filtering aggregation can then be performed (e.g., prior to any grouping aggregation) by removing any of the query search results determined, based on the filtering bitmap, as having data values for which the filtering aggregation is not satisfied.

Abstract: Provided herein are techniques for processing a database query aggregating data. Data tuples of a database object each including a grouping element and a data element are analyzed to determine a length of the data element for each data tuple. A plurality of tables each accommodate a successively greater length for the data element. A corresponding table of the plurality of tables to store each data tuple is determined based on the length of the data element of that data tuple relative to the accommodated lengths of the plurality of tables. Each data tuple in the determined corresponding table is stored to group the data tuples within each of the plurality of tables based on the grouping element, and an indication of corresponding tables containing members for each group is provided. The groups are combined across the plurality of tables to aggregate the data tuples for a database query.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: A superconducting magnet is provided for magnetic resonance imaging (MRI) or spectroscopy (MRS). The magnet has a plurality of discrete Niobium-Titanium superconductor coils arranged longitudinally along a common central axis, the Niobium-Titanium superconductor coils generating a first magnetic field when in use, the first magnetic field having high field regions of at least 5 Tesla radially inward of the discrete coils. At least two Niobium-Tin superconductor coils are located along the common central axis, each of which is located in a said high field region of the first magnetic field, the Niobium-Tin superconductor coils each generating a respective second magnetic field when in use, which combines with the first magnetic field to produce a resultant magnetic field which is of higher field strength than that of the first magnetic field at a location on the common central axis.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: A superconducting magnet is provided for magnetic resonance imaging (MRI) or spectroscopy (MRS). The magnet has a plurality of discrete Niobium-Titanium superconductor coils arranged longitudinally along a common central axis, the Niobium-Titanium superconductor coils generating a first magnetic field when in use, the first magnetic field having high field regions of at least 5 Tesla radially inward of the discrete coils. At least two Niobium-Tin superconductor coils are located along the common central axis, each of which is located in a said high field region of the first magnetic field, the Niobium-Tin superconductor coils each generating a respective second magnetic field when in use, which combines with the first magnetic field to produce a resultant magnetic field which is of higher field strength than that of the first magnetic field at a location on the common central axis.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: Responding to relational database queries (for example, SQL queries) in a new way. More specifically, qualifying queries are written (for example, written by a human individual) in a way so that a join operation precedes a row limiting operation. Notwithstanding the fact that the join operation precedes the row limiting operation, when responding to the query, machine logic (for example, software) performs the row limiting operation before the join operation. This can improve time and processing efficiency.

Abstract: The current invention discloses methods to treat disease caused by virus infection, bacterial infection, parasites infection, autoimmune disease, disease caused by production of unwanted antibodies, sepsis as well as methods to treat cancer and methods for virus infection detection using blood purification method. The current invention provides a method to treat pathogen infection by inactivating the pathogens in the blood. During the treatment, blood is withdrawn from a patient and is separated into its plasma and cellular components. The plasma portion is treated with physical means such as UV radiation to inactivate the pathogens inside and then is returned to the patient. The current invention also provide a method to treat cancer especially to prevent tumor metastasis and tumor recurrence by removing and/or inactivating (e.g. killing) the circulating tumor cells (CTC) in the blood after removing the tumor or treating the tumor with therapeutical means.

Abstract: The current invention discloses methods to treat disease caused by virus infection, bacterial infection, parasites infection, autoimmune disease, disease caused by production of unwanted antibodies, sepsis as well as methods to treat cancer and methods for virus infection detection using blood purification method. The current invention provides a method to treat pathogen infection by inactivating the pathogens in the blood. During the treatment, blood is withdrawn from a patient and is separated into its plasma and cellular components. The plasma portion is treated with physical means such as UV radiation to inactivate the pathogens inside and then is returned to the patient. The current invention also provide a method to treat cancer especially to prevent tumor metastasis and tumor recurrence by removing and/or inactivating (e.g. killing) the circulating tumor cells (CTC) in the blood after removing the tumor or treating the tumor with therapeutical means.

Abstract: This invention relates to isolated peptides derived from MAGE-C2, nucleic acid molecules that encode MAGE-C2 and the isolated peptides derived from MAGE-C2, expression vectors comprising the nucleic acid molecules, host cells transformed or transfected with the nucleic acid molecules or the expression vectors, and to tetramers comprising the peptides, HLA molecules, ?2 microglobulin and a first and second binding partner. This invention also relates to methods for using the peptides, nucleic acid molecules, expression vectors, tetramers and complexes of this invention as well as to cytolytic T cells which recognize the peptides in complex with an HLA molecule.

Abstract: A method, system, and computer program product for optimizing database queries in a data processing system. A query optimization (QO) utility maximizes the query coverage of Materialized Query Tables (MQTs) in order to efficiently process various types of incoming queries to a database engine. In particular, the QO utility enables MQT technology for nullable foreign key columns in a number of table joins involving fact tables and dimension tables, in which the fact tables and dimension tables have column data which are not null. The QO utility also enables MQT query matching for a relational database engine for non-additive measures, and improves the performance of existing query-matching capabilities for a relational database engine for additive measures. The QO utility specifies a number of functionally dependent relationships between the columns of a table in order to enhance the query matching abilities of the database engine.

Abstract: This invention relates to isolated peptides derived from MAGE-C2, nucleic acid molecules that encode MAGE-C2 and the isolated peptides derived from MAGE-C2, expression vectors comprising the nucleic acid molecules, host cells transformed or transfected with the nucleic acid molecules or the expression vectors, and to tetramers comprising the peptides, HLA molecules, ?2 microglobulin and a first and second binding partner. This invention also relates to methods for using the peptides, nucleic acid molecules, expression vectors, tetramers and complexes of this invention as well as to cytolytic T cells which recognize the peptides in complex with an HLA molecule.