Method and apparatus for managing shared data using a data surrogate and obtaining cost parameters from a data dictionary by evaluating a parse tree object

• US 5,689,698 A
• Filed: 10/20/1995
• Issued: 11/18/1997
• Est. Priority Date: 10/20/1995
• Status: Expired due to Term

• Current Assignee: Teradata US, Inc. (Teradata Corporation)
• Original Assignee: NCR Corporation
• Inventors: Luck, Colin, Saukkonen, Jukka I., Kaufmann, Arthur F., Jones, William Phillip
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): RONES, CHARLES
• Application Number:
  US08/546,283
• Time in Patent Office: 760 Days
• Field of Search: 395/612, 395/613, 395/800, 395/235, 395/604, 395/611, 395/610, 370/395, 380/24, 364/514 A
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• 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/99943 Generating database or data structure, e.g. via user interface

Abstract

A method and apparatus for providing access to object data stored in an object server in response to a database query. The method comprises the steps of receiving a database query comprising a relational operation with a data surrogate identifying object data stored in an object server, transforming the database query into relational database commands, transmitting the relational database commands to the relational database management system, receiving a response table from the relational database management system, compiling an answer set from the response table comprising an object locator responsive to the database query, and transmitting the answer set to the client.

Claims

1. A method of providing access to object data stored in an object server in response to a database query, comprising the steps of:

receiving the database query comprising a relational operation from a client, said relational operation comprising at least one object surrogate identifying object data stored in an object server;

transforming the database query into relational database commands;

transmitting the relational database commands to a relational database management system;

receiving a response table from the relational database management system;

compiling an answer set from the response table, the answer set comprising an object locator identifying the object data stored in the object server and responsive to the database query;

transmitting the answer set to the client;

wherein the transforming step comprises the steps of

parsing the database command into a parse tree of object structures comprising relational database commands and object server commands, said parse tree comprising parse tree nodes;

obtaining cost parameters for the parse tree object structures from a global data dictionary;

binding the cost parameters to the parse tree nodes;

iterating over the parse tree object structures to evaluate parse tree options according to the cost parameters and a selection criteria; and

selecting the parse tree option based upon the cost parameters and selected criteria.

2. The method of claim 1, wherein the global data dictionary (GDD) comprises a GDD cache which is updated when changes are made to the GDD.

3. The method of claim 2, wherein the GDD cache is user configurable and definable.

4. The method of claim 2, wherein the GDD cache is subdivided into boundary areas which are allocated to a GDD table whose values are replaced using a least recently used (LRU) algorithm.

5. The method of claim 1, wherein the cost parameters are selected from the group comprising statistical, static cost, and historical usage information of the parse tree object structures.

7. The apparatus of claim 5, wherein the global data dictionary (GDD) comprises a GDD cache which is updated when changes are made to the GDD.

8. The apparatus of claim 7, wherein the GDD cache is user configurable and definable.

9. The apparatus of claim 7, wherein the GDD cache is subdivided into boundary areas which are allocated to a GDD table whose values are replaced using a least recently used (LRU) algorithm.

15. The program storage device of claim 9, wherein the cost parameters are selected from the group comprising statistical, static cost, and historical usage information of the parse tree object structures.

6. An apparatus for providing access to object data stored in an object server in response to a database query, comprising:

a computer having a processor, the computer coupled to a data storage device;

means, performed by the computer, for receiving the database query from a client, the database query comprising a relational operation having at least one object surrogate identifying object data stored in an object server;

means, performed by the computer, for transforming the database query into relational database commands;

means, performed by the computer, for transmitting the relational database commands to a relational database management system;

means, performed by the computer, for receiving a response table from the relational database management system;

means, performed by the computer, for compiling an answer set from the response table, the answer set comprising an object locator identifying the object data stored in the object server and responsive to the database query;

means, performed by the computer, for transmitting the answer set to the client;

wherein the means for transforming the database query into relational database commands comprises

means, performed by the computer, for parsing the database command into a parse tree of object structures comprising relational database commands and object server commands, said parse tree comprising parse tree nodes;

means, performed by the computer, for obtaining cost parameters for the parse object structures from a global data dictionary;

means, performed by the computer, for binding the cost parameters to the parse tree nodes;

means, performed by the computer, for iterating over the parse tree object structures to evaluate parse tree options according to the cost parameters and a selection criteria; and

means, performed by the computer, for selecting the parse tree option based upon the cost parameters and selected criteria.

10. The apparatus of claim 6, wherein the cost parameters are selected from the group comprising statistical, static cost, and historical usage information of the parse tree object structures.

11. A program storage device, readable by a computer having a processor, the computer coupled to a data storage device, tangibly embodying one or more programs of instructions executable by the computer to perform method steps of providing access to object data stored in an object server in response to a database query, the method comprising the steps of:

receiving the database query comprising a relational operation from a client, said relational operation comprising at least one object surrogate identifying object data stored in an object server;

transforming the database query into relational database commands;

transmitting the relational database commands to a relational database management system;

receiving a response table from the relational database management system;

compiling an answer set from the response table, the answer set comprising an object locator identifying the object data stored in the object server and responsive to the database query;

transmitting the answer set to the client;

wherein the transforming step comprises the method steps of

parsing the database command into a parse tree of object structures comprising relational database commands and object server commands, said parse tree comprising parse tree nodes;

obtaining cost parameters for the parse object structures from a global data dictionary;

binding the cost parameters to the parse tree nodes;

iterating over the parse tree object structures to evaluate parse tree options according to the cost parameters and a selection criteria; and

selecting the parse tree option based upon the cost parameters and selected criteria.

12. The program storage device of claim 11, wherein the global data dictionary (GDD) comprises a GDD cache which is updated when changes are made to the GDD.

13. The program storage device of claim 12, wherein the GDD cache is user configurable and definable.

14. The program storage device of claim 12, wherein the GDD cache is subdivided into boundary areas which are allocated to a GDD table whose values are replaced using a least recently used (LRU) algorithm.