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 disclose a method, computer program product, and system for optimizing objects in object oriented programming. A computer receives application code having a plurality of application object fields. The computer receives information detailing a set of user-defined classes, wherein the user-defined classes include at least one object field. The computer analyzes the plurality of application object fields and the information detailing the set of user-defined classes to identify at least one object field in the set of user-defined classes that does not appear in the plurality of application object fields. The computer generates an instance of at least one user-defined class of the set of user-defined classes, wherein the instance does not include the at least one object field that does not appear in the plurality of application object fields.

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: Techniques are described for managing data between an in-memory data grid and a schemaless data store. In one example, a method includes generating hash codes for one or more keys. Each key is associated with one data item from a plurality of data items in the schemaless data store. The method further includes storing the hash codes in a persistent data structure. The method further includes receiving a request via the in-memory data grid to access a selected data item, wherein the selected data item has an associated key. The method further includes deriving a hash code for the key associated with the selected data item. The method further includes determining whether the derived hash code is present in the persistent data structure. The method further includes performing an operation based on the determination of whether the derived hash code is present in the persistent data structure.

Abstract: Techniques are described for managing data between an in-memory data grid and a schemaless data store. In one example, a method includes generating hash codes for one or more keys. Each key is associated with one data item from a plurality of data items in the schemaless data store. The method further includes storing the hash codes in a persistent data structure. The method further includes receiving a request via the in-memory data grid to access a selected data item, wherein the selected data item has an associated key. The method further includes deriving a hash code for the key associated with the selected data item. The method further includes determining whether the derived hash code is present in the persistent data structure. The method further includes performing an operation based on the determination of whether the derived hash code is present in the persistent data structure.

Abstract: A dynamic rebalancer operates in a server cluster independently of routers directing traffic to the servers in the cluster. An analysis component uses configuration information and statistics information to determine which session, if any, should be moved. A filter component receives transfer instructions from the analysis component. When the filter component receives transfer instructions from the analysis component, the filter component adds a redirect command to the client request. The filter component continually redirects client requests within the session to the new server until the client receives the redirect command and begins to send client requests to the new server.

Abstract: Various embodiments include solutions for querying desired data from a database without pulling supererogatory data. In one embodiment, a method includes: obtaining an initial database access query between an application and the database at a self-learning JDBC driver; monitoring subsequent database access queries between the application and the database over a period; and generating a modified database access query for querying the database from the self-learning JDBC driver, the modified database access query based upon the subsequent database access queries between the application and the database over the period.

Abstract: A dynamic rebalancer operates in a server cluster independently of routers directing traffic to the servers in the cluster. An analysis component uses configuration information and statistics information to determine which session, if any, should be moved. A filter component receives transfer instructions from the analysis component. When the filter component receives transfer instructions from the analysis component, the filter component adds a redirect command to the client request. The filter component continually redirects client requests within the session to the new server until the client receives the redirect command and begins to send client requests to the new server.

Abstract: Embodiments of the present invention provide a method, system and computer program product for automated cluster member management based on node capabilities. In one embodiment of the invention, a method for automated cluster member management based on node capabilities can be provided. The method can include defining a membership policy for a cluster, the membership policy specifying a nodal configuration required for a node in a cluster. The method further can include evaluating different nodes in a computing environment against the membership policy for the cluster. Finally, the method can include associating cluster members in the cluster to only those of the nodes having respective configurations meeting the nodal configuration of the membership policy. Likewise, the method can include evaluating nodes already in the cluster, and disassociating cluster members in the cluster from those of the nodes having respective configurations failing to meet the nodal configuration of the membership policy.

Abstract: A system and method of constructing cluster views may involve determining that a process such as an application server process having an IP address is stopped. Another IP address may be assigned to the process in response to determining that the process is stopped, wherein the other IP address is dedicated to processes that are stopped. If a connection request for the process is received at the other IP address, the connection request may be actively refused. The active refusal may significantly reduce the amount of time required to generate cluster views.

Abstract: A system and method of constructing cluster views may involve determining that a process such as an application server process having an IP address is stopped. Another IP address may be assigned to the process in response to determining that the process is stopped, wherein the other IP address is dedicated to processes that are stopped. If a connection request for the process is received at the other IP address, the connection request may be actively refused. The active refusal may significantly reduce the amount of time required to generate cluster views.

Abstract: A method, system and apparatus for on-demand application resource allocation. In accordance with the method of the invention, an anticipated workload can be compared to a measured capacity for an application cluster in one or more server computing nodes in a server farm. If the measured capacity warrants a re-configuration of the application clusters, a new placement can be computed for application server instances in individual ones of the server computing nodes. Subsequently, the new placement can be applied to the server computing nodes in the server farm. In this regard, the applying step can include starting and stopping selected ones of the application server instances in different ones of the server computing nodes to effectuate the new placement.

Abstract: A method, system, and computer program product, by which portions of the session information that page-content is dependent upon are “pushed” to the client from the origin server in a way such that auxiliary servers, e.g. other application servers and edge-servers, have access to the session information and fragment dependancy data to generate auxiliary-server cache-IDs for the custom pages. This enables distribution of the load away from the origin server, allowing better application distribution and scalability through more effective caching.

Abstract: The present invention provides a method, system, and computer program product for supporting a large number of intermittently used application clusters without consuming all the resources needed to run server processes for all the application clusters all the time. A method in accordance with the present invention comprises: holding an application request for a dormant application cluster in a holding zone; changing a status of the dormant application cluster to active; changing a status of an unused active application cluster to dormant; stopping server processes for the newly dormant application cluster; starting server processes for the newly active application cluster; and directing the application request held in the holding zone to the server processes for the newly active application cluster.

Abstract: Embodiments of the present invention provide a method, system and computer program product for automated cluster member management based on node capabilities. In one embodiment of the invention, a method for automated cluster member management based on node capabilities can be provided. The method can include defining a membership policy for a cluster, the membership policy specifying a nodal configuration required for a node in a cluster. The method further can include evaluating different nodes in a computing environment against the membership policy for the cluster. Finally, the method can include associating cluster members in the cluster to only those of the nodes having respective configurations meeting the nodal configuration of the membership policy. Likewise, the method can include evaluating nodes already in the cluster, and disassociating cluster members in the cluster from those of the nodes having respective configurations failing to meet the nodal configuration of the membership policy.

Abstract: A method and apparatus route hypertext protocol requests to one of a plurality of application servers, which share a database through a backend database management system. The application servers store session data in the database. Hence, if a subsequent request is routed to a different application server, the session data is available through the backend database management system. One or more web servers perform routing of requests to the application server. When a request is received that is accompanied by a session ID, routing is performed by utilizing a hash function on the session ID. The resulting hash value is mapped to an application server. A hash function on a session ID will always result in the same hash value; therefore, the request will always be routed to the same application server. However, if an application server is non-functional, a new hash based on the previous hash is computed until a functional application server is selected.

Abstract: A method, system, and computer program product, by which portions of the session information that page-content is dependent upon are “pushed” to the client from the origin server in a way such that auxiliary servers, e.g. other application servers and edge-servers, have access to the session information and fragment dependancy data to generate auxiliary-server cache-IDs for the custom pages. This enables distribution of the load away from the origin server, allowing better application distribution and scalability through more effective caching.

Abstract: A method and apparatus route hypertext protocol requests to one of a plurality of application servers, which share a database through a backend database management system. The application servers store session data in the database. Hence, if a subsequent request is routed to a different application server, the session data is available through the backend database management system. One or more web servers perform routing of requests to the application server. When a request is received that is accompanied by a session ID, routing is performed by utilizing a hash function on the session ID. The resulting hash value is mapped to an application server. A hash function on a session ID will always result in the same hash value; therefore, the request will always be routed to the same application server. However, if an application server is non-functional, a new hash based on the previous hash is computed until a functional application server is selected.

Abstract: A method, system, and computer program product, by which portions of the session information that page-content is dependent upon are “pushed” to the client from the origin server in a way such that auxiliary servers, e.g. other application servers and edge-servers, have access to the session information and fragment dependancy data to generate auxiliary-server cache-IDs for the custom pages. This enables distribution of the load away from the origin server, allowing better application distribution and scalability through more effective caching.