Direct call threaded code

• US 7,974,968 B2
• Filed: 05/06/2008
• Issued: 07/05/2011
• Est. Priority Date: 07/30/1999
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Doole, Douglas James, Finlay, Ian R.
• Primary Examiner(s): Breene; John
• Assistant Examiner(s): Ly; Anh
• Application Number:
  US12/116,071
• Publication Number:
  US 20080208799A1
• Time in Patent Office: 1,155 Days
• Field of Search: 707/713, 707/716, 707/718, 717/128, 717/129, 717/140, 717/141
• US Class Current: 707/713
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path, into a pre-pass operation. Advantageously, the mechanism reduces runtime overhead, and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation, already invested in the implementation of the DBMS.

Claims

1. A computer program product for use on a computer wherein queries are entered by a user for retrieving data in a relational database management system having a query optimizer for generating an access plan for executing the query, said computer program product comprising:

a recording medium;

means recorded on said medium for instructing said computer to perform the steps of,

(a) retrieving the access plan from memory;

(b) determining an executable function associated with the first operation code in the access plan;

(c) augmenting said operation code in the access plan with a pointer to an intermediate processing function and an auxiliary data structure storing a pointer to said executable function;

(d) repeating steps (b) and (c) for the remaining operation codes in the access plan;

(e) storing the modified access plan in memory.

2. The computer program product as claimed in claim 1, wherein said auxiliary data structure includes means for storing information associated with said executable function and said operation code.

3. The computer program product as claimed in claim 1, wherein said step (c) comprises augmenting said operation code in the access plan with another pointer to said auxiliary data structure, said auxiliary data structure providing means for storing information associated with said operation code and said executable function.

4. The computer program product as claimed in claim 1, wherein said step (b) further includes assessing the executable function associated with the operation code and replacing the call to the executable function with a call to another executable function.

5. The computer program product as claimed in claim 1, wherein said intermediate processing function includes processing operations the executable function associated with the operation code.

6. The computer program product as claimed in claim 5, wherein said processing operations in the intermediate processing function include gathering statistics on the use of the executable function associated with the operation code.

7. The computer program product as claimed in claim 1, wherein said processing operations in the intermediate processing function include a pause for receiving user input before the call to the executable function.

8. A relational database management system for use with a computer system wherein queries are entered by a user for retrieving data from tables, the relational database management system including a query optimizer for generating an access plan associated with the queries entered by the user, said relational database management system comprising:

(a) means for retrieving the access plan generated for a query from memory;

(b) means for determining an executable function associated with each of said operation codes in the access plan;

(c) means for augmenting said operation code in the access plan with a pointer to an intermediate processing function and an auxiliary data structure storing a pointer to said associated executable function;

(d) means for storing the modified access plan in memory.

9. The relational database management system as claimed in claim 8, wherein said auxiliary data structure includes means for storing information associated with said executable function an said operation code.

10. The relational database management system as claimed in claim 8, wherein said means for augmenting said operation code includes means for adding another pointer to said auxiliary data structure, said auxiliary data structure providing means for storing information associated with said operation code and said executable function.