Intelligent mapping for an enterprise grid

• US 10,320,896 B2
• Filed: 03/20/2017
• Issued: 06/11/2019
• Est. Priority Date: 09/10/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Amrhein, Dustin K., Berg, Douglas C., Bhogal, Kulvir S., Gaur, Nitin, Johnson, Christopher D.
• Primary Examiner(s): Bates, Kevin T
• Assistant Examiner(s): Siddiqi, Emad
• Application Number:
  US15/463,369
• Publication Number:
  US 20170195409A1
• Time in Patent Office: 813 Days
• Field of Search: 709217
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: H04L 45/7453 using hashing
• CPC Class Codes: H04L 67/1021 based on client or server locations

Abstract

A computer receives a request from a client application for data within an enterprise grid. The computer sends the data along with a program to monitor the application'"'"'s use of the data. The computer subsequently receives from the program a subset of the data being utilized by the client application. Responsive to a subsequent request for the data, the computer sends to the client application only the data corresponding to the identified subset of data being utilized.

Claims

1. A computer-implemented method for reducing database stress by processing data access requests using a collection of interconnected computing resources that are distributed across multiple computing systems, the method comprising:

identifying, by one or more processors, a client application that submitted a first request for access to a dataset that includes a set of values, the first request including a value key that identifies a type of the first request;

returning, by the one or more processors, a response for the first request that includes the dataset;

monitoring, by the one or more processors, a use of the values by the client application;

generating, by the one or more processors, a mapping table containing associations between client applications and value keys that were previously submitted in requests by each respective client application;

based on which fields in the dataset were accessed by a client program, determining, by the one or more processors, for the set of values both of (i) a first sub-set of values that were used by the client application for completion of a task by the client program and (ii) a second sub-set of values that were not used by the client application for completion of the task;

responsive to identifying the value key in a second request for access to the set of values included in the dataset, parsing, by the one or more processors, the set of values into the first sub-set of values and the second sub-set of values;

generating, by the one or more processors, a response for the second request that (i) includes the first sub-set of values and (ii) excludes the second sub-set of values; and

sending, by the one or more processors, the response for the second request to the client application.

2. The computer-implemented method of claim 1, further comprising:

for each value key submitted by each client application, associating, by the one or more processors, an indication of a given type of value used by a given client application to process a given task.

3. The computer-implemented method of claim 1, further comprising:

determining, by the one or more processors, whether the first request from the client application is a registered request based on (i) the client application being listed in the mapping table and (ii) the value key submitted by the client application being listed in association with the client application in the mapping table, wherein registration indicates that a specified client application has previously submitted a specific request that included a given value key.

4. The computer-implemented method of claim 3, further comprising:

responsive to a determination that a specific request from the client application is not registered, registering, by the one or more processors, the specific request by adding one or both of (i) an identity of the client application to the mapping table and (ii) the value key from the specific request to the mapping table to forming an association between the specific request and the client application.

5. The computer-implemented method of claim 1, further comprising:

responsive to receiving the second request, computing, by the one or more processors, a first hash of the value key, wherein the first hash identifies a server;

based on the first hash, generating, by the one or more processors, a second hash from the value key; and

accessing, by the one or more processors, one or more corresponding values on the server that are associated with the second hash; and

including, by the one or more processors, the one or more corresponding values as part of the dataset.

6. The computer-implemented method of claim 1, further comprising:

determining, by the one or more processors, one or more organization relationships between a given field and other fields included in the dataset, wherein the given field is included in the first sub-set of values based, in part, on the one or more organization relationships;

determining, by the one or more processors, a type of value for the given field; and

generating, by the one or more processors, a filtering criteria that identifies values of the type in the dataset based, at least in part, on one or both of (i) the organizational relationships, and (ii) an pattern of access for the given field, wherein the pattern of access is determined based, in part, on one or more of (a) a period of time elapsing, (b) a number of requests being received, and (c) a periodic verification of which fields are being accessed by the client application to complete the task.

7. A computer program product for reducing database stress by processing data access requests using a collection of interconnected computing resources that are distributed across multiple computing systems, the computer program product comprising:

one or more computer-readable storage media having computer-readable program code embodied therewith, the computer-readable program code comprising;

program instructions to identify a client application that submitted a first request for access to a dataset that includes a set of values, the first request including a value key that identifies a type of the first request;

program instructions to return a response for the first request that includes the dataset;

program instructions to monitor a use of the values by the client application;

program instructions to generate a mapping table containing associations between client applications and value keys that were previously submitted in requests by each respective client application;

program instructions to, based on which fields in the dataset were accessed by a client program, determine for the set of values both of (i) a first sub-set of values that were used by the client application for completion of a task by the client program and (ii) a second sub-set of values that were not used by the client application for completion of the task;

program instructions to respond to an identification of the value key in a second request for access to the set of values included in the dataset, by parsing the set of values into the first sub-set of values and the second sub-set of values;

program instructions to generate a response for the second request that (i) includes the first sub-set of values and (ii) excludes the second sub-set of values; and

program instructions to send the response for the second request to the client application.

8. The computer program product of claim 7, further comprising:

program instructions to, for each value key submitted by each client application, associate an indication of a given type of value used by a given client application to process a given task.

9. The computer program product of claim 7, further comprising:

program instructions to determine whether the first request from the client application is a registered request based on (i) the client application being listed in the mapping table and (ii) the value key submitted by the client application being listed in association with the client application in the mapping table, wherein registration indicates that a specified client application has previously submitted a specific request that included a given value key.

10. The computer program product of claim 9, further comprising:

program instructions to respond to a determination that a specific request from the client application is not registered, by registering the specific request by adding one or both of (i) an identity of the client application to the mapping table and (ii) the value key from the specific request to the mapping table to forming an association between the specific request and the client application.

11. The computer program product of claim 7, further comprising:

program instructions to respond to receiving the second request, by computing a first hash of the value key, wherein the first hash identifies a server;

program instructions to, based on the first hash, generate a second hash from the value key; and

program instructions to access one or more corresponding values on the server that are associated with the second hash; and

program instructions to include the one or more corresponding values as part of the dataset.

12. The computer program product of claim 7, further comprising:

program instructions to determine one or more organization relationships between a given field and other fields included in the dataset, wherein the given field is included in the first sub-set of values based, in part, on the one or more organization relationships;

program instructions to determine a type of value for the given field; and

program instructions to generate a filtering criteria that identifies values of the type in the dataset based, at least in part, on one or both of (i) the organizational relationships, and (ii) an pattern of access for the given field, wherein the pattern of access is determined based, in part, on one or more of (a) a period of time elapsing, (b) a number of requests being received, and (c) a periodic verification of which fields are being accessed by the client application to complete the task.

13. A computer system for reducing database stress by processing data access requests using a collection of interconnected computing resources that are distributed across multiple computing systems, the computer system comprising:

one or more processors;

one or more computer-readable storage media; and

program instructions stored on the one or more computer-readable storage media for execution by at least one of the one or more processors;

the program instructions comprising;

program instructions to identify a client application that submitted a first request for access to a dataset that includes a set of values, the first request including a value key that identifies a type of the first request;

program instructions to return a response for the first request that includes the dataset;

program instructions to monitor a use of the values by the client application;

program instructions to generate a mapping table containing associations between client applications and value keys that were previously submitted in requests by each respective client application;

program instructions to, based on which fields in the dataset were accessed by a client program, determine for the set of values both of (i) a first sub-set of values that were used by the client application for completion of a task by the client program and (ii) a second sub-set of values that were not used by the client application for completion of the task;

program instructions to respond to an identification of the value key in a second request for access to the set of values included in the dataset, by parsing the set of values into the first sub-set of values and the second sub-set of values;

program instructions to generate a response for the second request that (i) includes the first sub-set of values and (ii) excludes the second sub-set of values; and

program instructions to send the response for the second request to the client application.

14. The computer system of claim 13, further comprising:

program instructions to, for each value key submitted by each client application, associate an indication of a given type of value used by a given client application to process a given task.

15. The computer system of claim 13, further comprising:

program instructions to determine whether the first request from the client application is a registered request based on (i) the client application being listed in the mapping table and (ii) the value key submitted by the client application being listed in association with the client application in the mapping table, wherein registration indicates that a specified client application has previously submitted a specific request that included a given value key.

16. The computer system of claim 13, further comprising:

program instructions to respond to a determination that a specific request from the client application is not registered, by registering the specific request by adding one or both of (i) an identity of the client application to the mapping table and (ii) the value key from the specific request to the mapping table to forming an association between the specific request and the client application.

17. The computer system of claim 13, further comprising:

program instructions to respond to receiving the second request, by computing a first hash of the value key, wherein the first hash identifies a server;

program instructions to, based on the first hash, generate a second hash from the value key; and

program instructions to access one or more corresponding values on the server that are associated with the second hash; and

program instructions to include the one or more corresponding values as part of the dataset.