Structured query language to IMS transaction mapper

• US 6,253,200 B1
• Filed: 12/02/1997
• Issued: 06/26/2001
• Est. Priority Date: 10/11/1996
• Status: Expired due to Term

• Current Assignee: Xylon LLC (Intellectual Ventures LLC)
• Original Assignee: Sabre Incorporated (Sabre Corp.)
• Inventors: Clapper, Michael Raymond, Laroche, Guy Robert, Smedley, Richard Ray
• Primary Examiner(s): Kulik, Paul V.
• Application Number:
  US08/982,333
• Time in Patent Office: 1,302 Days
• Field of Search: 707/4, 707/2, 709/302, 709/328
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2433 Query languages
• CPC Class Codes: G06F 16/252 between a Database Management System and a front-end application
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

A process to access an IMS transaction based computer system from a structured query language (SQL) application program without revising or migrating the transaction based system. Binary virtual table mappings are built. An SQL statement from the SQL application program is parsed. Virtual column to transaction utilization mappings are extracted from the SQL statement. A possible solution set or solution sets are generated which may be capable of satisfying the SQL statement. Thereafter, transaction costs for each potential solution set are determined. Finally, a solution set with the lowest cost to satisfy the SQL statement is executed.

Claims

1. A method for accessing a transaction based computer system having transaction streams from a structured query language (SQL) application, the method comprising:

building a table with references to the transaction streams;

parsing an SQL statement from said SQL application;

extracting column to transaction utilization mappings from said SQL statement; and

generating transactions capable of satisfying said SQL statement based on the extracted column to transaction utilization mappings.

2. The method of claim 1, further comprising:

executing the transactions of the solution set.

3. The method of claim 1, wherein said structured query language application is open database compatible (ODBC).

4. The method of claim 1, further comprising:

storing said table in a file.

5. The method of claim 1, wherein the generating step includes:

determining a transaction cost for each of the transactions.

6. The method of claim 1, wherein the parsing step includes:

analyzing said statement for its lexicon and syntax.

7. The method of claim 1, further including:

communicating between said SQL application and a transaction-based system with APPC.

8. An apparatus for accessing a transaction based computer system having transaction streams from a structured query language (SQL) application, the apparatus comprising:

a building component configured to build a table with references to the transaction streams;

a parser configured to parse an SQL statement from said SQL application;

an extractor configured to extract column to transaction utilization mappings from said SQL statement; and

a generator configured to generate transactions capable of satisfying said SQL statement based on the extracted column to transaction utilization mappings.

9. The apparatus of claim 8, further comprising:

a processor configured to execute the transactions of the solution set.

10. The apparatus of claim 8, wherein said structured query language application is open database connectivity compliant (ODBC).

11. The apparatus of claim 8, further comprising:

a storage configured to store said table.

12. The apparatus of claim 8, wherein the generator includes:

a component configured to determine a transaction cost for each transaction.

13. The apparatus of claim 8, wherein the parser includes:

a component configured to analyze said statement for its lexicon and syntax.

14. The apparatus of claim 8, further including:

a component configured to communicate between said SQL application and a transaction-based system with APPC.