Patent US6996625B2 successfully refreshed from Google Patents.
US6996625B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reduction and optiminization of operational query expressions applied to information spaces between nodes in a publish/subscribe system
Assignee: International Business Machines Corp
•
Filing: 2003-11-21
•
Granted: 2006-02-07
•
Expires: 2023-11-21
Abstract
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.
Inventors
- 👤 Marc A. Kaplan
- 👤 Kelly Anne Shaw
- 👤 Daniel C. Sturman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 06:13
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/542; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99935
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
104 words
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.
Claim 2
Independent Claim
104 words
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.
Claim 3
Dependent Claim
22 words
The method of claim 1 , further comprising: rearranging processing resources within said information processing system to accommodate each said equivalent sequence.
Claim 4
Dependent Claim
25 words
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.
Claim 5
Dependent Claim
35 words
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.
Claim 6
Dependent Claim
21 words
A method for reorganizing message processing operations in a message processing system comprising using the arranging method of claim 1 .
Claim 7
Dependent Claim
16 words
The method of claim 5 , wherein said reorganizing is facilitated by an automated processing system.
Claim 8
Dependent Claim
31 words
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.
Claim 9
Dependent Claim
39 words
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.
Claim 10
Dependent Claim
42 words
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.
Claim 11
Independent Claim
112 words
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.
Claim 12
Independent Claim
112 words
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.
Claim 13
Dependent Claim
24 words
The system of claim 10 , further comprising: means for rearranging processing resources within said information processing system to accommodate each said equivalent sequence.
Claim 14
Dependent Claim
27 words
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.
Claim 15
Dependent Claim
37 words
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.
Claim 16
Dependent Claim
46 words
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.
Claim 17
Dependent Claim
145 words
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.
Claim 18
Dependent Claim
145 words
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.
Claim 19
Dependent Claim
30 words
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.
Claim 20
Dependent Claim
33 words
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.
Claim 21
Dependent Claim
43 words
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.
Claim 22
Dependent Claim
53 words
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.
References Cited (Backward Citations)
US5175843A
Cited
US5367675A
Cited
US5412804A
Cited
US5511186A
Cited
US5701456A
Cited
US5504885A
Cited
US5659725A
Cited
US6032144A
Cited
US6061676A
Cited
US5848408A
Cited
US5857097A
Cited
US20020083049A1
Cited
US20020032675A1
Cited
US6370524B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2009-02-06 | 2009-08-08 | 2010-02-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2013-02-06 | 2013-08-08 | 2014-02-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2017-02-06 | 2017-08-08 | 2018-02-07 | $7700.00 | Window Closed / Lapsed |