Method and device for processing a query in a database management system

• US 20040019587A1
• Filed: 04/16/2003
• Published: 01/29/2004
• Est. Priority Date: 07/25/2002
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hrle, Namik, Fuh, You-Chin
• Application Number:
  US10/418,442
• Publication Number:
  US 20040019587A1
• Time in Patent Office: Days
• US Class Current: 707/2
• CPC Class Codes: G06F 16/24547 Optimisations to support specific applications; Extensibility of optimisers

Abstract

According to one aspect of the present invention, a method is provided for processing a query in a database management system that generates an access plan to retrieve desired data from computer storage in response to the query. An identification is derived from at least a portion of a received query or representation thereof. The access plan is generated in consideration of a hint associated with the identification, if such a hint is available from a repository of hints.

Claims

1. A method of processing a query in a database management system that generates an access plan to retrieve desired data from computer storage in response to the query, the method comprising:

deriving an identification from at least a portion of a received query or representation thereof; and

generating the access plan in consideration of a hint associated with said identification, if such a hint is available from a repository of hints.

2. The method of claim 1, further comprising:

checking a flag indicating whether or not hints are to be considered for said identification.

3. The method of claim 1, wherein said representation of said received query is semantically equivalent to the query as specified in an external application.

4. The method of claim 3, wherein said representation of said received query is identical to said query as specified in said external application.

5. The method of claim 3, wherein said query is specified in said external application in the form of an SQL statement.

6. The method of claim 3, wherein said repository is kept separate from said external application.

7. The method of claim 1, wherein the step of deriving an identification from at least a portion of said query or representation thereof includes executing a digest function.

8. The method of claim 7, wherein said digest function is formed by a hash function.

9. The method of claim 1, wherein said repository is formed by at least one of the group of:

an operating system file, a database table, and internal memory.

10. The method of claim 1, further comprising generating the access plan without any hints if the associated hint is not available.

11. The method of claim 1, wherein the identification is derived using a transformation applied to the query or representation thereof, said transformation also having been applied to an identical previous query or representation thereof at the time of creation of said hint associated with said query or representation thereof.

12. A device for processing a query in a database management system that generates an access plan to retrieve desired data from computer storage in response to the query, the device comprising:

a deriving component for deriving an identification from at least a portion of a representation of a received query; and

a generating component for generating the access plan in consideration of a hint associated with said identification, said hint found in a repository of hints.

13. The device of claim 12, further comprising a checking component for checking a flag indicating whether or not hints are to be considered for said identification.

14. The device of claim 12, wherein said representation is semantically equivalent to the query as specified in an external application.

15. The device of claim 14, wherein said representation is identical to said query as specified in said external application.

16. The device of claim 14, wherein said query is specified in said external application in form of an SQL statement.

17. The device of claim 14, wherein said repository is kept separate from said external application.

18. The device of claim 12, wherein said deriving component includes a component for executing a digest function.

19. The device of claim 18, wherein said digest function is formed by a hash function.

20. The device of claim 12, wherein said repository is formed by at least one of the group of:

an operating system file, a database table, and internal memory.

21. The device of claim 12, wherein said generating component for generating the access plan includes a query optimizer.

22. A computer readable medium including program instructions for causing a computer to perform a method comprising:

deriving an identification from at least a portion of a received predetermined representation of a query;

accessing a repository of user-specified hints in order to find a hint associated with said identification; and

generating the access plan in consideration of the user-specified hint, if a user-specified hint could be retrieved from said repository.

23. The computer readable medium of claim 22, wherein the method further comprises:

checking a flag indicating whether or not hints are to be considered for said identification.

24. The computer readable medium of claim 22, wherein said representation of said received query is semantically equivalent to the query as specified in an external application.

25. The computer readable medium of claim 24, wherein said representation of said received query is identical to said query as specified in said external application.

26. The computer readable medium of claim 24, wherein said query is specified in said external application in the form of an SQL statement.

27. The computer readable medium of claim 24, wherein said repository is kept separate from said external application.

28. The computer readable medium of claim 22, wherein the deriving an identification from at least a portion of said query or representation thereof includes executing a digest function.

29. The computer readable medium of claim 28, wherein said digest function is formed by a hash function.

30. The computer readable medium of claim 22, wherein said repository is formed by at least one of the group of:

an operating system file, a database table, and internal memory.

31. The computer readable medium of claim 22, further comprising generating the access plan without any hints if the associated hint is not available.

32. The computer readable medium of claim 22, wherein the identification is derived using a transformation applied to the query or representation thereof, said transformation also having been applied to an identical previous query or representation thereof at the time of creation of said hint associated with said query or representation thereof.

33. The computer readable medium of claim 22, wherein said generating the access plan is performed by a query optimizer.