Method, system and computer-readable media for software object relationship traversal for object-relational query binding

• US 20080065592A1
• Filed: 03/29/2007
• Published: 03/13/2008
• Est. Priority Date: 09/08/2006
• Status: Active Grant

• Current Assignee: Objectivity, Inc.
• Original Assignee: Objectivity, Inc.
• Inventors: Doyle, Blade Makai
• Granted Patent: US 8,527,502 B2
• Time in Patent Office: Days
• US Class Current: 707/2
• CPC Class Codes: G06F 16/24532 of parallel queries

Abstract

A system method and computer-readable media for searching an object oriented database are provided. The present invention may be employed to detect software bugs, deficiencies and/or errors in, affecting, or related to, an object database management system. The invented technique may use an SQL table join query to search for incomplete, damaged or erroneous software objects.

Claims

1. In an information technology system having a software data base, a method for traversing a query tree in execution of an outer join query, the method comprising:

a. Formatting the query with an equivalency join operator;

b. Selecting at least two child nodes in the execution of the query wherein both child nodes are projection nodes; and

c. Selecting at least two child nodes selected in step b wherein the associated grandchild nodes are table scan nodes.

2. The method of claim 1, wherein the data base is a federated data base.

3. The method of claim 1, wherein the data base is an object oriented data base.

4. The method of claim 1, wherein the data base comprises software objects.

5. The method of claim 1, wherein the query is formatted in accordance with a structured query language query syntax.

6. The method of claim 5, wherein the query is formatted in accordance with a structured query language query syntax.

7. The method of claim 1, further comprising determining which selected child node is a near node and which selected child node is a far node, wherein the near node includes a pointer to the far node.

8. The method of claim 7, further comprising fetching a next near object;

and extracting an object identification of the far object from the near object.

9. The method of claim 8, further comprising referencing the extracted object identification of the far object to fetch the far object.

10. The method of claim 9, further comprising extracting data from the far object.

11. The method of claim 10, further comprising returning data extracted from the far object.

12. The method of claim 10, further comprising reporting data extracted from the far object in accordance with a structured query language syntax.

20. A computer-readable media comprising machine-readable instructions that direct a computational system to execute the steps of the method of claim 1.

13. In an information technology system having a software data base, a method for traversing a query tree in execution of an outer join query, the method comprising:

a. Forming the query;

b. Selecting a first node and a second node satisfying the query; and

c. Locating an object identification of the second node that is stored within the first node.

14. The method of claim 13, wherein the query is structured in accordance with a structured query language syntax.

15. The method of claim 14, further comprising reading the second object identification of the second node as located within the first node.

16. The method of claim 15, further comprising fetching the second node by reference to the second node object identification.

17. The method of claim 16, further comprising extracting information from the second node.

18. The method of claim 17, further comprising returning data requested by the query.

19. The method of claim 17, further comprising reporting data requested by the query in accordance with a structured query language.