Publication number | US20030084061 A1 |

Publication type | Application |

Application number | US 10/038,136 |

Publication date | May 1, 2003 |

Filing date | Oct 26, 2001 |

Priority date | Oct 26, 2001 |

Also published as | US7263694 |

Publication number | 038136, 10038136, US 2003/0084061 A1, US 2003/084061 A1, US 20030084061 A1, US 20030084061A1, US 2003084061 A1, US 2003084061A1, US-A1-20030084061, US-A1-2003084061, US2003/0084061A1, US2003/084061A1, US20030084061 A1, US20030084061A1, US2003084061 A1, US2003084061A1 |

Inventors | Fred Clewis, Richard Sitze |

Original Assignee | International Business Machines Corporation |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (29), Referenced by (2), Classifications (7), Legal Events (6) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 20030084061 A1

Abstract

A system and method for efficiently walking a directed non-cyclic graph of hierarchical data using multiple analysis tools. The graph walking system comprises: a system for binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; graph walking logic for systematically walking through nodes within the graph, wherein the graph walking logic can be instructed by a first pruning system not to walk a set of sub-nodes of an encountered node; and a second pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until the set of sub-nodes for the encountered node has been walked. The first pruning system will cause the set of sub-nodes not to be walked only if all of the plurality of graph observers have been deactivated.

Claims(20)

a binding system for binding a graph observer with a graph, for binding node patterns to node observers to generate at least one node pairing, and for binding the graph observer to at least one node pattern-node observer pairing;

graph walking logic for systematically walking through nodes within the directed non-cyclic graph;

a pattern testing system for determining if an encountered node matches one of the node patterns;

an event manager for generating an encountered event when one of the node observers is bound to a matching node pattern; and

a pruning system that can deactivate the graph observer with respect to sub-nodes of the encountered node if a bound node observer determines that there is no interest in the sub-nodes.

a system for binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers;

graph walking logic for systematically walking through nodes within the graph;

a first pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until a set of sub-nodes for the encountered node has been walked; and

a second pruning system that can instruct the graph walking logic not to walk the set of sub-nodes for the encountered node.

binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers;

systematically walking through nodes within the graph;

generating an encounter event and handling the encounter event with a bound node observer when one of the node patterns matches an encountered node;

deactivating the graph observer associated with the bound node observer if the bound node observer determines that a set of sub-nodes of the encountered node should be pruned; and

bypassing the walking of the set of sub-nodes if all of the plurality of graph observers have been deactivated.

program code configured to bind a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers;

program code configured to provide graph walking logic for systematically walking through nodes within the graph;

program code configured to provide a first pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until a set of sub-nodes for an encountered node has been walked; and

program code configured to provide a second pruning system that can instruct the graph walking logic not to walk the set of sub-nodes for the encountered node.

Description

- [0001]1. Technical Field
- [0002]The present invention relates generally to analyzing and processing hierarchical data structured in directed non-cyclic graphs, and more particularly relates to a system and method for providing an optimized parallel analysis of such hierarchical data. This includes directed graph representations of tree's and other non-cyclic graphs.
- [0003]2. Related Art
- [0004]The collection, processing, and analysis of electronic information have become critical tools in today's business methodologies. For instance, businesses recognize the importance of leveraging electronic information in order to more efficiently deliver goods and services to consumers. Analysis of such information might provide important business intelligence, reveal consumer interests, and determine marketplace trends.
- [0005]However, as the amount of electronic information that is generated continues to grow, the ability to effectively and efficiently analyze the information becomes more challenging. Specifically, there is a significant time and cost factor involved in analyzing and processing large databases of information (i.e., data mining). For many large institutions, it may take on the order of hours to analyze or “walk through” a database of electronic information. The problem is further exacerbated when different processing or analysis tools must be run on the same set of data. In this case, the time and cost factor is multiplied by the number of required tools.
- [0006]One method for handling large databases is to store, or arrange the information in a hierarchy. Directed non-cyclic graphs, are comprised of nodes arranged in a hierarchical fashion, with the more general information stored at the top, and more specific information branched off below, terminating in leaf nodes. Leaf nodes do not have children (directed lines from the leaf node to another node). In some cases information stored at the lower levels of the hierarchy may be referenced by multiple nodes higher in the graph, representing multiple references to common, or shared, information. Since the graph is non-cyclic, there is never a path from any given node that arrives back at that same node. Therefore a strict hierarchy of data is maintained. Note that a tree is a common degenerative form of a directed non-cyclic graph.
- [0007]U.S. Pat. No. 6,055,539, entitled METHOD TO REDUCE I/O FOR HIERARCHICAL DATA PARTITIONING METHODS, issued on Apr. 25, 2000, which is hereby incorporated by reference, describes a method for classifying hierarchical data to allow for more efficient processing of a data set.
- [0008]While data hierarchies and related methods for storing data have improved the process of analyzing large databases, the prior art has failed to adequately solve the problem of efficiently performing multiple processes or applying multiple tools to a set of hierarchical data. For example, a straightforward recursive descent walk of a hierarchical data tree of N nodes by M analysis routines would require N*M visits to the individual nodes. As is evident, a more efficient mechanism for handling this situation is required.
- [0009]“Design Patterns—Elements of Reusable Object-Oriented Software,” by Gamma, Helm, Johnson, and Vlissides (ISBN 0-201-63361-2), pages 293-303, copyright 1995, which is hereby incorporated by reference, describes an ‘Observer’, or ‘PublishSubscribe’ design pattern. While not directly applicable to a static directed graph, the mechanism describes an ‘event drive’ model for processing data that has been used to allow multiple analysis routines access to the hierarchical data. Such algorithms are frequently used in the processing of XML, for example the Simple API for XML (SAX) uses this event driven model. However, this disclosure fails to provide efficient optimization techniques for handling such data.
- [0010]The present invention solves the above-mentioned problems, as well as others, by providing a system and method that allow multiple analysis tools to process a directed non-cyclic graph in parallel, and efficiently “prune” or eliminate the processing of unnecessary data. In a first aspect, the invention provides a graph walking system, comprising: a binding system for binding a graph observer with a graph, for binding node patterns to node observers to generate at least one node pairing, and for binding the graph observer to at least one node pattern-node observer pairing; graph walking logic for systematically walking through nodes within the graph; a pattern testing system for determining if an encountered node matches one of the node patterns; an event manager for generating encountered and completed events when one of the node observers is bound to a matching node pattern; and a pruning system that can deactivate the graph observer with respect to sub-nodes of the encountered node if a bound node observer determines that there is no interest in the sub-nodes.
- [0011]In a second aspect, the invention provides a system for analyzing a directed non-cyclic graph of hierarchical data, comprising: a system for binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; graph walking logic for systematically walking through nodes within the graph; a first pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until a set of sub-nodes for the encountered node has been walked; and a second pruning system that can instruct the graph walking logic not to walk the set of sub-nodes for the encountered node.
- [0012]In a third aspect, the invention provides a method for analyzing a directed non-cyclic graph of hierarchical data, comprising the steps of: binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; systematically walking through nodes within the graph; generating an encounter event and handling the encounter event with a bound node observer when one of the node patterns matches an encountered node; deactivating the graph observer associated with the bound node observer if the bound node observer determines that a set of sub-nodes of the encountered node should be pruned; and bypassing the walking of the set of sub-nodes if all of the plurality of graph observers have been deactivated.
- [0013]In a fourth aspect, the invention provides a program product stored on a recordable medium, which when executed, analyzes a directed non-cyclic graph of hierarchical data, the program product comprising: program code configured to bind a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; program code configured to provide graph walking logic for systematically walking through nodes within the graph; program code configured to provide a first pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until a set of sub-nodes for an encountered node has been walked; and program code configured to provide a second pruning system that can instruct the graph walking logic not to walk the set of sub-nodes for the encountered node.
- [0014]The preferred exemplary embodiment of the present invention will hereinafter be described in conjunction with the appended drawings, where like designations denote like elements, and:
- [0015][0015]FIG. 1 depicts a block diagram of an exemplary graph observer architecture in accordance with the present invention.
- [0016][0016]FIG. 2 depicts an exemplary directed non-cyclic graph, in this case a tree.
- [0017][0017]FIG. 3 depicts a block diagram of a graph walking system in accordance with a preferred embodiment of the present invention.
- [0018][0018]FIG. 4 depicts a flow diagram of a graph walking method in accordance with the present invention.
- [0019]Referring now to the figures, FIG. 1 depicts an exemplary graph walking architecture
**10**in accordance with the present invention that allows multiple analysis tools to efficiently operate on hierarchical data**12**in a parallel manner. As shown, hierarchical data**12**comprises a first graph**14**and a second graph**16**(i.e., tree**1**and tree**2**). Each graph is composed of a hierarchy of nodes, and each graph may be a subgraph of some larger graph. Bound to the first graph**14**are two graph observers T**1**and T**2**. Bound to the second graph**16**is a third graph observer T**3**. Each graph observer embodies a method of analyzing/processing the information in the graph to which it is bound (i.e., it provides an analysis tool). The process of actually walking through a graph is handled by a graph walker, or graph walking logic, which systematically guides the processing of nodes within the graph. As each graph is walked, the bound graph observers look for matching node patterns, which will in turn cause one or more node observers to analyze or process the particular node. Although this invention is directed to non-cyclic directed graphs, it should be understood that the invention could be extended to cover a cyclic graph, using techniques known to those skilled in the art. - [0020]Exemplary node patterns might include named or unnamed node attributes, or node types. A simple node pattern identifies distinguishing node attributes (i.e. names and/or types) of a single node by specifying attribute-patterns for each attribute of a node. An attribute-pattern name might be “exact match”, “phonetic match” (e.g., a soundex algorithm), or a regular expression (i.e., wild-card) match. For example, a simple node pattern could specify match “fred” for the name attribute, and match-any for all other attributes of a node.
- [0021]As can be seen, each graph observer T
**1**, T**2**and T**3**is bound to one or more sets or “pairings” (shown within dotted lines) of node patterns (NP) and node observers (NO). Within each pairing, one or more node patterns are bound to one or more node observers. Thus, for example, graph observer T**1**is shown bound to: a first pairing**23**comprised of node pattern**24**and node observer**28**; a second pairing**27**comprised of node pattern**25**and node observer**30**; and a third pairing**29**comprised of node pattern**26**and node observer**32**. Graph observer T**2**is similarly bound to a pairing comprised of node pattern**24**and node observers**36**and**38**. Note that two instances of the same node pattern may exist. For example, graph observers T**1**and T**2**both have pairings that use node pattern**24**. Graph observer T**3**, which is bound to the second graph**16**, is bound to three pairings**41**,**43**, and**45**. Pairing**41**comprises node pattern**40**and node observer**46**. Pairing**43**comprises node pattern**42**and node observer**46**. Pairing**45**comprises node pattern**44**and node observer**48**. Note that a single instance of node observer**46**is shared by different pairings**41**and**43**. Accordingly, unique groupings of graph, graph observer, node pattern(s) and node observer(s) are created, which may be referred to herein as graph/graph observer sets. It should be understood that the number and arrangement of graphs, graph observers, node patterns, and node observers shown in FIG. 1 are for exemplary purposes only. - [0022]Because of the binding between graph observers and node observers, graph observers T
**1**and T**2**are able to efficiently process graph**14**in a parallel manner. As will be described in further detail below, the graph walking process is made more efficient based on information discerned by the node observers. In particular, the node observers can cause their respective graph observers to become inactive while sub-nodes are being walked (a first pruning system), and in certain cases cause the walking of sub-nodes to be skipped entirely (a second pruning system). These two pruning mechanisms greatly enhance the efficiency of the graph walking system of the present invention, particularly in the case where multiple graph observers (i.e., analysis tools) operate on a single graph. - [0023]Although the exemplary embodiments described herein are directed at optimizing the walking of hierarchical data graphs, it should be appreciated that the techniques, systems and methods described herein could be readily applied to any type of “directed graph.” Directed graphs describe directed relationships (e.g., edges and lines) between entities (e.g., nodes).
- [0024]Referring now to FIG. 2, exemplary graph
**14**is shown in greater detail. - [0025]Specifically, graph
**14**is shown comprised of twelve nodes N**1**, N**2**, N**3**, . . . N**12**arranged in a hierarchical manner. Assuming a straightforward recursive descent walk of the graph**14**, node N**1**would be processed first, followed by node N**2**, etc., until node N**12**. To illustrate how the invention might operate, each node is shown with parentheses listing the graph observers that are activate when the node is encountered by the graph walking logic. As noted above, graph observers can be made inactive for the processing of the sub-nodes of the encountered node when a node observer determines that there is no interest in the sub-nodes. In this example, both graph observers T**1**and T**2**are active for processing of nodes N**1**, N**2**, N**3**, and N**6**. However, when node N**3**was encountered, a determination was made to deactivate graph observer T**2**for the processing of sub-nodes N**4**and N**5**. Thus, only graph observer T**1**remains active while nodes N**4**and N**5**are walked. - [0026]Furthermore, during the processing of node N
**1**, it was determined to deactivate graph observer T**1**for sub-nodes N**7**-N**12**using a first pruning system (described below). Also, when node N**7**is encountered, it was determined to deactivate graph observer T**2**for sub-nodes N**8**-N**12**, again using the first pruning system. Moreover, in this situation, a second pruning system will cause the graph walking logic to entirely skip the walking of nodes N**8**-N**12**. It should be appreciated that graph**14**, as well as the graph observers that are shown processing the nodes, are shown for exemplary purposes only, and obviously a much more complex graph could be walked using this methodology. - [0027]Referring now to FIG. 3, a graph walking system
**52**is shown for operating on hierarchical data**80**. Graph walking system**52**generally comprises a graph identification system**62**, binding systems**54**,**55**and a graph processor**66**. Graph identification system**62**identifies graphs within the hierarchical data**80**that are to be processed. Each identified graph may be referred to as a root graph, or a subgraph of a root graph that is to be walked. It should be noted that multiple graphs may be identified for a single walking process. - [0028]Binding system (A)
**54**receives the sets (i.e., zero or more) of graph observers**56**, node patterns**58**, and node observers**60**. As shown in FIG. 1, each graph observer is bound to one or more pairings (i.e., bound sets of node patterns and node observers). Binding system**54**thus creates one or more “graph observer/(node pattern-node observer pairings)” groupings**53**, such as groupings**13**,**15**and**17**shown in FIG. 1. Each grouping**53**is then further bound to a graph (as identified by graph identification system**62**) by binding system (B)**55**. Note that a graph observer may be bound to more than one graph, and multiple graph observers may be bound to a single graph. The output is a set of graph/graph observer combinations**64**that each include one or more node pattern-node observer pairings. The graph/graph observer combinations**64**form the analysis tools that will facilitate the processing of hierarchical data**80**using graph processor**66**. - [0029]During processing, graph processor
**66**walks each graph separately and includes graph walking logic**68**that determines how the nodes within the graph will be walked (e.g., a left-right recursive descent). Graph walking logic**68**includes a sub-node pruning system**70**that can dynamically cause graph walking logic**68**to skip the walking of groups of sub-nodes. Specifically, sub-node pruning**70**will cause a set of sub-nodes not to be walked when all of the graph observers have been made inactive for the set of sub-nodes. The process for deactivating sets of sub-nodes is described in further detail below. - [0030]Graph processor
**66**further includes a node pattern testing system**72**that determines if an encountered node matches any of the node patterns bound to the graph observers for the graph being walked. If a node pattern matches an encountered node of an active graph observer, an encountered event is generated for each node observer bound to the node pattern. Thus for example, referring back to FIG. 1, if graph observer T**1**is active, and node pattern**24**matches an encountered node, then node observers**28**and**30**may each cause an encountered event to be generated. The process of generating events is handled by event processing system**74**. In general, events are generated during a graph walk process when matching nodes are encountered, and when walks of subgraphs of nodes are completed. It should nonetheless be appreciated that event processing system**74**can also generate events for other occurrences that may be of interest. - [0031]When an encountered event is generated, node observer handling system
**76**causes the registered node observer to handle the event. During the handling of the event, the node observer can notify graph observer pruning system**78**that processing of sub-nodes (if present) should proceed, or that the sub-nodes should be pruned. Specifically, graph observer pruning system**78**is provided to activate or deactivate graph observers associated with node observers that are handling such events. Thus, if a node observer determines that there is no interest in a set of sub-nodes, graph observer pruning system**78**will deactivate the graph observer associated with the node observer for the processing of the sub-nodes. If all of the graph observers are made inactive for a particular set of sub-nodes, then graph walking logic**68**will skip the walking of the set of sub-nodes (i.e., sub-node pruning**70**will be executed). - [0032]As each graph is walked, sub-nodes of each encountered node are processed in the same manner. Namely, if a sub-node of the current node matches a node pattern, or has any child at any depth that matches a node pattern bound to a node observer bound to an active graph observer, then the sub-node is processed in the same exact manner as described above.
- [0033]When the walk of a set of sub-nodes of a node has been completed, any graph observers that were made inactive by the encountered event are reactivated, i.e., made active. Moreover, a completed event is generated for each node observer that received an encountered event and which indicated that the sub-nodes should be walked (i.e., its graph observer remained active). In addition to the features described above, a completed event may notify the graph walking logic
**68**that the sub-nodes must be walked again. - [0034]The process of handling multiple nodes observers that are registered to a matching node pattern may be accomplished as follows. Consider a graph-observer T with node-observers NO
**1**, NO**2**, NO**3**, and NO**4**. For some node N all four observers are determined to “match” the node's pattern. The order in which the node observers are triggered for “encountered” events is the order in which they are registered as node-observers. The order for “completed” events is the reverse of the order in which they are registered. For this example, the order of registration is NO**1**, NO**2**, NO**3**, and NO**4**. Within a set of node observers all belonging to the same graph observer (T), the node observers are notified of an event sequentially (parallelism applies to node-observers from different graph-observers). - [0035]Thus, if NO
**1**is notified of an “encountered” event, and notifies the graph walker that processing of sub-nodes can proceed, NO**2**is then notified, which notifies the graph walker that processing of sub-nodes can be proceed. NO**3**is then notified, and for this example indicates to the graph walker that sub-nodes should be pruned. The graph observer T is placed into the inactive state, NO**4**is not notified of any event, and events are not generated for any node observer that belongs to T for any sub-node of N. If there is only one graph observer, or if all other graph observers are also inactive, then the graph walker prunes the subgraph completely using sub-node pruning**70**. If the subgraph was pruned, or when all other graph observers are done processing the subgraph, then T is marked active and the “completed” event is generated for node N as follows: NO**4**is not notified of the “encountered” event, so it is not notified of the “completed” event. NO**3**indicated that it had no further interested in that branch of the graph, so it is not notified. NO**2**is notified of the completed event. Finally, NO**1**is notified of the completed event. - [0036]Referring now to FIG. 4, a method flow chart
**82**that describes the walking of a node is depicted. First, a node walk**84**is initiated until a node encounter**86**occurs. At that point, the node is compared to one or more node patterns associated with any active graph observers to determine if there is a match**88**. If there is no match, the node walk**84**continues. If there is a match, an encounter event is generated and the event is handled with one or more node observers**90**. The node observers then determine if sub-nodes of the encountered node should be pruned**92**. If no pruning is required, then the sub-nodes are walked**94**, the event is completed**96**, and node walk continues**84**. Note that the walking of the sub-nodes**94**is done recursively using the logic beginning at node walk**84**. - [0037]If pruning is required, the graph observer associated with the node observer that asked for pruning is deactivated
**98**. Next, it is determined if other graph observers are active**100**. If no other graph observers are active the sub-nodes are not walked**102**, the event is completed**96**, and the node walking continues**84**. If there are other graph observers that are active, then the sub-nodes are walked**104**. Walking of sub-nodes**104**is likewise done in a recursive manner using the logic beginning at node walk**84**. When the sub-node walking is complete, the graph observer is reactivated**106**, the event is completed**96**, and node walking continues**84**. - [0038]It is understood that the components of the present invention can be realized in hardware, software, or a combination of hardware and software. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when loaded and executed, carries out the methods described herein. Alternatively, a specific use computer, containing specialized hardware for carrying out one or more of the functional tasks of the invention could be utilized. Aspects of the present invention can also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program, software program, program, module, mechanism or software, in the present context mean any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: (a) conversion to another language, code or notation; and/or (b) reproduction in a different material form.
- [0039]The foregoing description of the preferred embodiments of this invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and obviously, many modifications and variations are possible. Such modifications and variations that may be apparent to a person skilled in the art are intended to be included within the scope of this invention as defined by the accompanying claims.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US4782444 * | Dec 17, 1985 | Nov 1, 1988 | International Business Machine Corporation | Compilation using two-colored pebbling register allocation method such that spill code amount is invariant with basic block's textual ordering |

US5379422 * | Jan 16, 1992 | Jan 3, 1995 | Digital Equipment Corporation | Simple random sampling on pseudo-ranked hierarchical data structures in a data processing system |

US5386394 * | Sep 2, 1993 | Jan 31, 1995 | Hitachi, Ltd. | Semiconductor memory device for performing parallel operations on hierarchical data lines |

US5423040 * | Jan 14, 1994 | Jun 6, 1995 | International Business Machines Corporation | System and method for efficiently executing directed acyclic graphs |

US5606698 * | Mar 7, 1995 | Feb 25, 1997 | Cadence Design Systems, Inc. | Method for deriving optimal code schedule sequences from synchronous dataflow graphs |

US5671419 * | Jun 15, 1995 | Sep 23, 1997 | International Business Machines Corporation | Interprocedural data-flow analysis that supports recursion while only performing one flow-sensitive analysis of each procedure |

US5761667 * | Aug 7, 1996 | Jun 2, 1998 | Bmc Software, Inc. | Method of optimizing database organization using sequential unload/load operations |

US5836014 * | May 16, 1994 | Nov 10, 1998 | Digital Equipment Corporation | Method of constructing a constant-folding mechanism in a multilanguage optimizing compiler |

US5838977 * | Jun 7, 1995 | Nov 17, 1998 | Texas Instruments Incorporated | Translating an object graph at run time |

US5867711 * | Nov 17, 1995 | Feb 2, 1999 | Sun Microsystems, Inc. | Method and apparatus for time-reversed instruction scheduling with modulo constraints in an optimizing compiler |

US5873081 * | Jun 27, 1997 | Feb 16, 1999 | Microsoft Corporation | Document filtering via directed acyclic graphs |

US5877775 * | Aug 6, 1997 | Mar 2, 1999 | Theisen; Karen E. | Method of generating a 3-D representation of a hierarchical data structure |

US5887174 * | Jun 18, 1996 | Mar 23, 1999 | International Business Machines Corporation | System, method, and program product for instruction scheduling in the presence of hardware lookahead accomplished by the rescheduling of idle slots |

US6055539 * | Jun 27, 1997 | Apr 25, 2000 | International Business Machines Corporation | Method to reduce I/O for hierarchical data partitioning methods |

US6064819 * | Apr 2, 1997 | May 16, 2000 | Imec | Control flow and memory management optimization |

US6092044 * | Mar 28, 1997 | Jul 18, 2000 | Dragon Systems, Inc. | Pronunciation generation in speech recognition |

US6212498 * | Mar 28, 1997 | Apr 3, 2001 | Dragon Systems, Inc. | Enrollment in speech recognition |

US6292938 * | Dec 2, 1998 | Sep 18, 2001 | International Business Machines Corporation | Retargeting optimized code by matching tree patterns in directed acyclic graphs |

US6381735 * | Nov 20, 1998 | Apr 30, 2002 | Microsoft Corporation | Dynamic classification of sections of software |

US6654761 * | Jul 29, 1998 | Nov 25, 2003 | Inxight Software, Inc. | Controlling which part of data defining a node-link structure is in memory |

US6681221 * | Oct 18, 2000 | Jan 20, 2004 | Docent, Inc. | Method and system for achieving directed acyclic graph (DAG) representations of data in XML |

US6741242 * | Jul 17, 2000 | May 25, 2004 | Famotik Kabushikikaisha | Multimedia documents integrating and displaying system |

US6741255 * | Aug 14, 1997 | May 25, 2004 | Sun Microsystems, Inc. | Method, apparatus and computer program product for using deferred execution for a tiling pull model in a tiled image processing architecture |

US6745384 * | Sep 21, 2000 | Jun 1, 2004 | Microsoft Corporation | Anticipatory optimization with composite folding |

US6957422 * | Dec 7, 2001 | Oct 18, 2005 | Microsoft Corporation | Dynamic classification of sections of software |

US20010042062 * | Jul 29, 1998 | Nov 15, 2001 | Tichomir G. Tenev | Controlling which part of data defining a node-link structure is in memory |

US20020162096 * | Apr 27, 2001 | Oct 31, 2002 | Robison Arch D. | Pruning local graphs in an inter-procedural analysis solver |

US20030135619 * | Jul 15, 2002 | Jul 17, 2003 | Wilding Mark F. | Dynamic status tree facility |

US20050193037 * | Feb 26, 2004 | Sep 1, 2005 | Adiba Nicolas G. | Peer-to-peer replication member initialization and deactivation |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US8566772 * | Aug 27, 2012 | Oct 22, 2013 | Sankhya Technologies Private Limited | Method, computer program and computing system for optimizing an architectural model of a microprocessor |

US20130074030 * | Mar 21, 2013 | Sankhya Technologies Private Limited | Method, computer program and computing system for optimizing an architectural model of a microprocessor |

Classifications

U.S. Classification | 1/1, 707/E17.011, 707/999.102 |

International Classification | G06F7/00, G06F17/30 |

Cooperative Classification | G06F17/30958 |

European Classification | G06F17/30Z1G |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

Mar 26, 2002 | AS | Assignment | Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CLEWIS, FRED T.;SITZE, RICHARD A.;REEL/FRAME:012743/0774 Effective date: 20011031 |

Apr 4, 2011 | REMI | Maintenance fee reminder mailed | |

Jun 15, 2011 | FPAY | Fee payment | Year of fee payment: 4 |

Jun 15, 2011 | SULP | Surcharge for late payment | |

Jul 12, 2011 | AS | Assignment | Owner name: GOOGLE INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:026664/0866 Effective date: 20110503 |

Mar 2, 2015 | FPAY | Fee payment | Year of fee payment: 8 |

Rotate