Intelligent data pool management engine

• US 7,181,491 B2
• Filed: 04/04/2003
• Issued: 02/20/2007
• Est. Priority Date: 04/04/2003
• Status: Active Grant

• Current Assignee: Taiwan Semiconductor Manufacturing Company Limited
• Original Assignee: Taiwan Semiconductor Manufacturing Company Limited
• Inventors: Lu, Ying-Lon
• Primary Examiner(s): Meky; Moustafa M.
• Application Number:
  US10/406,896
• Publication Number:
  US 20040215789A1
• Time in Patent Office: 1,418 Days
• Field of Search: 709200-203, 709217-226, 709/229, 707/10
• US Class Current: 709/203
• CPC Class Codes: G06F 16/252 between a Database Management System and a front-end application
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/10015 Access to distributed or replicated servers, e.g. using brokers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 67/14 Session management for real-time applications in data packet communications networks H04L65/1066

Abstract

A method of managing access by a plurality of clients to a plurality of respectively different databases comprises the steps of: receiving a plurality of requests by the plurality of clients to access a plurality of different databases, the queries being received by a single application server; dynamically analyzing use of channel connections between the single application server and the plurality of databases; and dynamically allocating the channel connections between the single application server and each of the plurality of databases to service the plurality of queries based on the analyzing.

Claims

1. A method of managing access by a plurality of clients to a plurality of respectively different databases, comprising the steps of:

(a) receiving a plurality of requests by the plurality of clients to access a plurality or different databases, the queries being received by a single application server;

(b) dynamically analyzing use of channel connections between the single application server and the plurality of databases; and

(c) dynamically allocating the channel connections between the single application server and each of the plurality of databases to service the plurality of queries based on the analyzing by;

establishing a default number of channels to be allocated by the single application server for each database; and

increasing the number of channels allocated to one of the databases above the default number of channels corresponding to that database, if one of the clients issues a query to that database and none of the channels currently allocated to that database is currently available.

2. The method of claim 1, further comprising:

maintaining the number of channels allocated to the one database above the default number of channels corresponding to that database for at least a predetermined period of time after the increasing step.

3. The method of claim 2, further comprising de-allocating one of the channels allocated to the one database if:

the one channel has been idle for at least the predetermined period of time; and

the number of channels allocated to the one database is greater than the default number of channels corresponding to that one database.

4. The method of claim 1, wherein step (c) includes changing the default number of channels corresponding to at least one of the databases based on the analyzing of step (b).

5. The method of claim 1, wherein step (b) includes calculating a number of channels to assign to each database based on at least one of the group consisting of an average running time of each database and a hit ratio of each database.

6. The method of claim 5, wherein a total number of channels allocated to all of the databases is determined by the equation:

T=(X₁−

I₁)/H₁+(X₂−

I₂)/H₂+. . . +(X_D−

I_D)/H_D,

where T is the total number of channels, X_i is the number of channels in use for database i, I_i is the number of channels allocated to database i that are not used, and H_i is the hit ratio of the channels for database i, and D is the number of backend databases.

7. The method of claim 6, wherein a respective number of channels assigned to each database is given by the equation:

N_i=T/D*(Avg_i/Tavg)/H_i,

where N_i is the number of channels for database i, Avg_i is an average amount of time a corresponding application server for database i accesses database i during a given period, and Tavg is a total of the average running times for all of the databases in the given period.

8. The method of claim 1, wherein step (a) includes receiving the plurality of requests by way of a common interface.

9. The method of claim 8, wherein the plurality of requests use structured query language.

10. A data pool manager for controlling access by a plurality of clients to a plurality of respectively different databases, comprising:

a single application server that receives a plurality of requests by the plurality of clients to access a plurality of different databases;

means for dynamically analyzing use of channel connections between the single application server and the plurality of databases; and

means for dynamically allocating the channel connections between the single application server and each of the plurality of databases to service the plurality of queries based on the analyzing, including means for establishing a default number of channels to be allocated by the single application server for each database, and means for increasing the number of channels allocated to one of the databases above the default number of channels corresponding to that database, if one of the clients issues a query to that database and none of the channels currently allocated to that database is currently available.

11. The data pool manager of claim 10, wherein the allocating means maintains the number of channels allocated to the one database above the default number of channels corresponding to that database for at least a predetermined period of time after the increasing step.

12. The data pool manager of claim 11, wherein the allocating means further comprises means for de-allocating one of the channels allocated to the one database if:

the one channel has been idle for at least the predetermined period of time; and

the number of channels allocated to the one database is greater than the default number of channels corresponding to that one database.

13. The data pool manager of claim 10, wherein the allocating means includes means for changing the default number of channels corresponding to at least one of the databases in response to the analyzing means.

14. The data pool manager of claim 10, wherein the analyzing means calculates a number of channels to assign to each database based on at least one of the group consisting of an average running time of each database and a hit ratio of each database.

15. The data pool manager of claim 14, wherein a total number of channels allocated to all of the databases is determined by the equation:

T=(X₁−

I₁)/H₁+(X₂−

I₂)/H₂+. . . +(X_D−

I_D)/H_D ,

where T is the total number of channels, X_i is the number of channels in use for database i, I₁ is the number of channels allocated to database i that are not used, and H_i is the hit ratio of the channels for database i, and D is the number of backend databases.

16. The data pool manager of claim 15, wherein a respective number of channels assigned to each database is given by the equation:

N_i=T/D*(Avg_i/Tavg)/H_i,

where N_i is the number of channels for database i, Avg_i is an average amount of time a corresponding application server for database i accesses database i during a given period, and Tavg is a total of the average running times for all of the databases in the given period.

17. The data pool manager of claim 10, wherein the application server receives the plurality of requests by way of a common interface.

18. The data pool manager of claim 17, wherein the plurality of requests use structured query language.

19. A computer readable medium encoded with computer program code, wherein, when the computer program code is executed by a processor, the processor performs a method of managing access by a plurality of clients to a plurality of respectively different databases, comprising the steps of:

(a) receiving a plurality of requests by the plurality of clients to access a plurality of different databases, the queries being received by a single application server;

(b) dynamically analyzing use of channel connections between the single application server and the plurality of databases; and

(c) dynamically allocating the channel connections between the single application server and each of the plurality of databases to service the plurality of queries based on the analyzing, wherein the dynamically allocating includes establishing a default number of channels to be allocated by the single application server for each database, and increasing the number of channels allocated to one of the databases above the default number of channels corresponding to that database, if one of the clients issues a query to that database and none of the channels currently allocated to that database is currently available.

20. The computer readable medium of claim 19, wherein the method further comprises:

maintaining the number of channels allocated to the one database above the default number of channels corresponding to that database for at least a predetermined period of time after the increasing step.

21. The computer readable medium of claim 20, wherein the method further comprises de-allocating one of the channels allocated to the one database if:

the one channel has been idle for at least the predetermined period of time; and

the number of channels allocated to the one database is greater than the default number of channels corresponding to that one database.

22. The computer readable medium of claim 19, wherein step (c) includes changing the default number of channels corresponding to at least one of the databases based on the analyzing of step (b).

23. The computer readable medium of claim 19, wherein step (b) includes calculating a number of channels to assign to each database based on at least one of the group consisting of an average running time of each database and a hit ratio of each database.

24. The computer readable medium of claim 23, wherein a total number of channels allocated to all of the databases is determined by the equation:

T=(X₁−

I₁)/H₁+(X₂−

I₂)/H₂+. . . +(X_D−

I_D)/H_D,

where T is the total number of channels, X_i is the number of channels in use for database i, I₁ is the number of channels allocated to database i that are not used, and H_i is the hit ratio of the channels for database i, and D is the number of backend databases.

25. The computer readable medium of claim 24, wherein a respective number of channels assigned to each database is given by the equation:

N_i=T/D*(Avg_i/Tavg)/H_i,

where N_i is the number of channels for database i, Avg_i is an average amount of time a corresponding application server for database i accesses database i during a given period, and Tavg is a total of the average running times for all of the databases in the given period.

26. The computer readable medium of claim 19, wherein step (a) includes receiving the plurality of requests by way of a common interface.

27. The computer readable medium of claim 26, wherein the plurality of requests use structured query language.