Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG.

Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: Embodiments of the present invention provide a method, system and computer program product for IMDG No-SQL schema optimization. In an embodiment of the invention, an IMDG No-SQL schema optimization method is provided. The method includes parsing documents of a No-SQL database, such as a document-oriented database, to select an object model mapping the documents of the No-SQL database to different portions of the IMDG, and selecting a partitioning schema for the IMDG according to the documents. Thereafter, a change in the documents of the No-SQL database can be detected, for example a change in data density of the documents of the No-SQL database, and in response to detecting the change, the documents of the No-SQL database are parsed to select a new object model of the No-SQL database mapping the documents to different portions of the IMDG, and to select a new partitioning schema for the IMDG according to the documents.

Abstract: A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template.

Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG.

Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: Embodiments of the invention provide a method, system and computer program product for optimized continuous query processing in an in memory data grid (IMDG). In an embodiment of the invention, a method for optimized continuous query processing in an IMDG includes receiving a request to add an object to an IMDG. The method also includes evaluating a continuous query upon the object in order to produce a result. The method yet further includes adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result. The method even yet further includes inserting the object with the attribute into the IMDG. Finally, the method includes returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

Abstract: A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template.

Abstract: Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG.

Abstract: Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG.

Abstract: Embodiments of the present invention provide a method, system and computer program product for IMDG No-SQL schema optimization. In an embodiment of the invention, an IMDG No-SQL schema optimization method is provided. The method includes parsing documents of a No-SQL database, such as a document-oriented database, to select an object model mapping the documents of the No-SQL database to different portions of the IMDG, and selecting a partitioning schema for the IMDG according to the documents. Thereafter, a change in the documents of the No-SQL database can be detected, for example a change in data density of the documents of the No-SQL database, and in response to detecting the change, the documents of the No-SQL database are parsed to select a new object model of the No-SQL database mapping the documents to different portions of the IMDG, and to select a new partitioning schema for the IMDG according to the documents.

Abstract: A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template.

Abstract: A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template.

Abstract: In alternate embodiments, the invention is a message-passing process for routing communications between a transmitting parallel process and a receiving parallel process executing in an application server environment, or a machine or computer-readable memory having the message-passing process programmed therein, the message-passing process comprising: linking a context key to an addressable computing resource in the application server environment; linking the receiving parallel process to the context key; receiving a communication from the transmitting parallel process, wherein the communication transmits the context key; and routing the communication to the addressable computing resource linked to the context key.

Abstract: An apparatus and method provide efficient dynamic request distribution among a plurality of resources when a resource in the plurality of resources returns an abnormal rate of exceptions. A dynamic request distributor monitors exception rates by resource in the plurality of resources resulting from requests made to the resources in the plurality of resources. If a particular resource returns exceptions at an abnormally high rate, the dynamic request distributor responds by routing relatively fewer subsequent requests to that particular resource.

Abstract: One computer system in a cluster includes a dynamic routing mechanism that receives all incoming messages for the cluster. When a message is received, the dynamic routing mechanism checks its dynamic routing table, and routes a message to the appropriate partition that corresponds to the address of the message. If a resource has been moved to a different partition, the dynamic routing mechanism may route the message to the old partition instead of the new one. In this case, the old partition receives the message, determines whether the message is intended for it, and if not, the partition forwards the message to the appropriate target partition. The partition then notifies the dynamic routing mechanism of the change in location of the resource, which causes the dynamic routing mechanism to update its dynamic routing table to reflect the change in location for the resource.

Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, switch between synchronous processing and asynchronous processing for a request if the synchronous processing for the request is unsuccessful and send a synchronous response to a client that initiated the request after the asynchronous processing of the request. In an embodiment, an asynchronous response for the asynchronous processing is sent to a bridge, which then sends the synchronous response to the client. In this way, the client may receive a synchronous response even if the request is performed by asynchronous processing.