Reduction and optiminization of operational query expressions applied to information spaces between nodes in a publish/subscribe system

• US 6,996,625 B2
• Filed: 11/21/2003
• Issued: 02/07/2006
• Est. Priority Date: 05/28/1999
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sturman, Daniel C., Kaplan, Marc A., Shaw, Kelly Anne
• Primary Examiner(s): Prieto, Beatriz
• Application Number:
  US10/719,039
• Publication Number:
  US 20040107290A1
• Time in Patent Office: 809 Days
• Field of Search: 709 1- 10, 709217-219, 709/203, 709/231, 708/5, 708/400, 707/4
• US Class Current: 709/231
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

Techniques for arranging operations performable on information in an information processing system are provided. In a system having a plurality of information producers and a plurality of information subscribers, paths are identified over which information traverses, and within which the information is subject to select and/or transform operations. The present invention optimizes the system by reorganizing the sequence of select and transform operations so that transforms follow select operations; and by combining multiple select and transform operations into single select and transform operations, respectively. Using these optimizations, the processing resources of the system can be reorganized, and/or information flow graphs describing the system can be designed, so that the select operations are “pushed” toward the producers, and transform operations are “pushed” toward the subscribers. Efficient content-based routing systems can then be used to implement the select operations.

Claims

1. A method for arranging operations performable on information in an information processing system, the information processing system having a plurality of information producers and a plurality of information subscribers, the method comprising:

identifying respective sequences of select and transform operations required on information between at least some information producer/subscriber pairs;

converting each respective sequence identified into an equivalent sequence, including;

pushing select operations ahead of transform operations in each said equivalent sequence, and

combining any sequential select operations and any sequential transform operations in each said equivalent sequence;

wherein each said equivalent sequence comprises a single select operation followed by a single transform operation.

2. The method of claim 1, further comprising:

rearranging processing resources within said information processing system to accommodate each said equivalent sequence.

3. The method of claim 1, further comprising:

employing a content-based routing system to perform the single select operation of at least one equivalent sequence.

4. The method of claim 1, further comprising prior to said converting:

adding exterior nodes, and paths thereto, from respective interior nodes, to accommodate future information production to, or subscription from, said respective interior nodes.

5. A method for reorganizing message processing operations in a message processing system comprising using the arranging method of claim 1.

6. The method of claim 5, wherein said reorganizing is facilitated by an automated processing system.

7. A method for arranging an information flow graph descriptive of message processing operations for a method processing system comprising using the arranging method of claim 1 on said information flow graph.

8. The method of claim 7, wherein said method for arranging the information flow graph is performed on an automated processing system, and wherein the information flow graph comprises information tangibly stored on media in said automated processing system.

9. The method of claim 1, wherein said converting comprises:

reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.

10. A system for arranging operations performable on information in an information processing system, the information processing system having a plurality of information producers and a plurality of information subscribers, the system comprising:

means for identifying respective sequences of select and transform operations required on information between at least some information producer/subscriber pairs;

means for converting each respective sequence identified into an equivalent sequence, including;

means for pushing select operations ahead of transform operations in each said equivalent sequence, and

means for combining any sequential select operations and any sequential transform operations in each said equivalent sequence;

wherein each said equivalent sequence comprises a single select operation followed by a single transform operation.

11. The system of claim 10, further comprising:

means for rearranging processing resources within said information processing system to accommodate each said equivalent sequence.

12. The system of claim 10, further comprising:

means for employing a content-based routing system to perform the single select operation of at least one equivalent sequence.

13. The system of claim 10, further comprising prior to said converting:

means for adding exterior nodes, and paths thereto, from respective interior nodes, to accommodate future information production to, or subscription from, said respective interior nodes.

14. The system of claim 10, wherein said means for converting comprises:

means for reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.

15. An article of manufacture comprising a computer useable medium having computer readable program code means embodied therein for arranging operations performable on information in an information processing system, the information processing system having a plurality of information producers and a plurality of information subscribers, the article of manufacture comprising:

computer readable program code means for identifying respective sequences of select and transform operations required on information between at least some information producer/subscriber pairs;

computer readable program code means for converting each respective sequence identified into an equivalent sequence, including;

computer readable program code means for pushing select operations ahead of transform operations in each said equivalent sequence, and

computer readable program code means for combining any sequential select operations and any sequential transform operations in each said equivalent sequence;

wherein each said equivalent sequence comprises a single select operation followed by a single transform operation.

16. The article of manufacture of claim 15, further comprising:

computer readable program code means for rearranging processing resources within said information processing system to accommodate each said equivalent sequence.

17. The article of manufacture of claim 15, further comprising:

computer readable program code means for employing a content-based routing system to perform the single select operation of at least one equivalent sequence.

18. The article of manufacture of claim 15, further comprising prior to said converting:

computer readable program code means for adding exterior nodes, and paths thereto, from respective interior nodes, to accommodate future information production to, or subscription from, said respective interior nodes.

19. The article of manufacture of claim 15, wherein said code means for converting comprises:

computer readable program code means for reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.