Method, system and computer-readable media for software object relationship traversal for object-relational query binding
First Claim
Patent Images
1. In an information technology system having an input device, an output device, an object oriented software data base (“
- data base”
), a method instantiated during a query execution, the method comprising;
a. Receiving a query string from a user via the input device;
b. Forming a query tree;
c. Selecting an equivalence join node of the query tree having at least two child nodes wherein both child nodes are projection node software objects;
d. Designating a near node from the two child nodes;
e. Designating a far node from the two child nodes;
f. Instantiating a near tuple of the near node;
g. Reading a far object identification (“
the far OID”
) of the far node as referenced by the near node;
h. Detecting an anomaly associated with the far OID; and
i. Informing the user via the output device of a descriptive quality of the detected anomaly associated with the far OID when the near tuple fails to reference the far node, wherein a failure of reference of the near node to the far node is determined and reported to a user at the instance of a query process.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
12 Claims
-
1. In an information technology system having an input device, an output device, an object oriented software data base (“
- data base”
), a method instantiated during a query execution, the method comprising;a. Receiving a query string from a user via the input device; b. Forming a query tree; c. Selecting an equivalence join node of the query tree having at least two child nodes wherein both child nodes are projection node software objects; d. Designating a near node from the two child nodes; e. Designating a far node from the two child nodes; f. Instantiating a near tuple of the near node; g. Reading a far object identification (“
the far OID”
) of the far node as referenced by the near node;h. Detecting an anomaly associated with the far OID; and i. Informing the user via the output device of a descriptive quality of the detected anomaly associated with the far OID when the near tuple fails to reference the far node, wherein a failure of reference of the near node to the far node is determined and reported to a user at the instance of a query process. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
- data base”
-
12. A tangible non-transitory computer-readable media comprising machine-readable instructions that direct a computational system to execute the method of:
-
a. Receiving a query string from a user via the input device; b. Forming a query tree; c. Selecting an equivalence join node of the query tree having at least two child nodes wherein both child nodes are projection node software objects; d. Designating a near node from the two child nodes; e. Designating a far node from the two child nodes; f. Instantiating a near tuple of the near node; g. Reading an object identification (“
OID”
) of the far node;h. Searching the near tuple for the presence of the OID of the far node; and i. Informing the user via the output device of a descriptive quality of the detected anomaly associated with the far OID when the near tuple fails to reference the far node, wherein a failure of reference of the near node to the far node is determined and reported to a user at the instance of a query process.
-
Specification