Object-oriented query mechanism

• US 5,752,028 A
• Filed: 04/03/1996
• Issued: 05/12/1998
• Est. Priority Date: 04/03/1996
• Status: Expired due to Fees

• Current Assignee: Transparency Systems Incorporated
• Original Assignee: Transparency Systems Incorporated
• Inventors: Ellacott, Bruce Arthur
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US08/627,197
• Time in Patent Office: 769 Days
• Field of Search: 395/614, 395/603
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2456 Join operations
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure

Abstract

The invention is a method for making joins and retrieving joined data during query processing in a database. An object sends a message with join criteria to one or more other objects or classes of objects. Objects receiving the message forward the data which they have or data which may potentially be useful to a receiving object, then stop processing, without waiting for a reply. Messages for a particular object are processed in a queue without reference to messages for other objects.

Claims

1. A method of query processing in a database wherein data is sought to be retrieved and combined using at least two objects, which comprises;

(A) sending at least one message from a first object to at least one second object within the database, said message specifying criteria for a join,

(B) said message being acted upon by the method of the second object to form at least one output from each second object which has some of the data sought or other potentially relevant data, each such output containing some of the data sought or data which is related or potentially related to the data sought or a pointer to such data,

(C) each said output proceeding independently either to another object so said output can be acted upon by the method of such other object to form a further output or to a results object which stores final or intermediate results, and

(D) each object which has sent an output not awaiting replies from other objects to which its output has been sent before finishing its processing.

2. A method as claimed in claim 1 in which data which is related or potentially related to the data sought is sent to a results object.

3. A method as claimed in claim 1, in which an object having data which is related or potentially related to the query sends a pointer to the results object, whereby the results object can locate the object with the potentially useful data should the data be required to respond to the query.

4. A method as claimed in claim 1, in which a message is sent out in step (A) of claim 1 to all objects within a class of objects.

5. A method as claimed in claim 1, in which a plurality of messages is sent out during step (A) of claim 1, and some such messages are sent to individual objects and, others are sent to groups of objects, and each said second object which receives both types of messages processes both types of messages from a queue.

6. A message as claimed in claim 5, in which the messages are accorded different priorities for processing according to whether they are messages to a group of objects or to said individual second object.

7. A method as claimed in claim 1, in which some messages as set out in step (A) of claim 1 are accorded different priorities, and such priorities are used to order messages in a queue for processing.

8. A method as claimed in claim 1 including the step of coordinating the processing of messages directed to groups of objects with the processing of messages directed to individual objects so that an individual second object is retrieved from physical storage to be processed by a thread, all messages directed to that individual object and directed to the groups of objects which include that object are processed as they relate to that object, and one or more output messages are generated by that object as set out in step (B) of claim 1 prior to processing of another second object by the thread.

9. A method as set out in claim 1 which includes the additional step of maintaining counts of unprocessed outstanding messages generated in steps (A), through (D) and reporting that the query has been completed when such counts are all zero.

10. In a distributed database having network nodes, the improvement in query processing which comprises

A) sending at least one message from an object on a first node to at least one object on a second node within the database,

B) said message being acted upon by the method of the second object to form at least one message from each second object which has some of the data sought or other potentially relevant data, each such output containing some of the data sought or data which is related or potentially related to the data sought or a pointer to such data,

(C) each said output proceeding independently either to another object so said output can be acted upon by the method of such other object to form a further output or to a results object which stores final or intermediate results, and

(D) each object which has sent an output not awaiting replies from other objects to which its output has been sent before finishing its processing,

(E) maintaining a message count of unprocessed outstanding messages generated in steps (A) through (C) at each node which receives such messages, and

(F) causing such node to notify all other nodes which have sent it messages when its local processing is complete.